Distance rationalizability of scoring rules
Collective decision making problems can be seen as finding an outcome that is "closest" to a concept of "consensus".  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  distance).  shows that the Dodgson rule is the closest to Condorcet under swap distance. [4, 5] 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 . Therefore, the results herein generalizes  and builds a connection between scoring rules and a generalization of the Kemeny distance, i.e. weighted distances.
|Date of creation:||01 Jan 2013|
|Date of revision:|
|Contact details of provider:|| Postal: P.O. Box 616, 6200 MD Maastricht|
Phone: +31 (0)43 38 83 830
Web page: http://www.maastrichtuniversity.nl/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:unm:umagsb:2013068. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen)
If references are entirely missing, you can add them using this form.