Template-type: ReDif-Paper 1.0
Author-Name: Can B. 
Author-workplace-name: GSBE
Title: Distance rationalizability of scoring rules
Abstract: Collective decision making problems can be seen as finding an outcome that is closest to aconcept of consensus. Nitzan 1981 introduced Closeness to Unanimity Procedure as a first example to this approach and showed that the Borda rule is the closest to unanimity under swap distance a.k.a the Kemeny 1959 distance. Meskanen and Nurmi 2008 shows that the Dodgson rule is the closest to Condorcet under swap distance. Elkind et al. 2009, 2012 generalized this concept as distance-rationalizability, where being close is measured via various distance functions and with many concepts of consensus, e.g., unanimity, Condorcet etc. In this paper, we show that all non-degenerate scoring rules can be distance-rationalized as Closeness to Unanimity procedures under a class of weighted distance functions introduced in Can 2012. Therefore, the results herein generalizes, partly, the results in Nitzan 1981 and complements the extensive findings in Elkind et al. 2009.
Keywords: 
Classification-JEL: .
Series:  Research Memorandum
Creation-Date: 2013
Number: 028
File-URL: http://pub.maastrichtuniversity.nl/141f46d2-f2f9-4d87-aefe-41e741e76c71
File-Format: application/pdf
File-Size: 345580
Handle: RePEc:unm:umagsb:2013028