Aggregation of Rankings: a Brief Review of Distance-Based Rules
Some researchers have addressed the problem of aggregating individual preferences or rankings by seeking a ranking that is closest to the individual rankings. Their methods differ according to the notion of distance that they use. The best known method of this sort is due to Kemeny. The first part of this paper offers a brief survey of some of these methods. Another way of approaching the aggregation of rankings is as a problem of optimal statistical inference, in which an expected loss is minimised. This approach requires a loss function, a concept closely related the notion of distance between rankings. The second part of this paper examines two classes of parametric functions and proposes one class for the optimal statistical inference problem.
|Date of creation:||2005|
|Date of revision:|
|Contact details of provider:|| Postal: CP 8888, succursale Centre-Ville, Montréal, QC H3C 3P8|
Phone: (514) 987-8161
Web page: http://www.cirpee.org/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Truchon, Michel, 2004.
"Aggregation of Rankings in Figure Skating,"
Cahiers de recherche
0402, Université Laval - Département d'économique.
- Wade D. Cook & Lawrence M. Seiford, 1978. "Priority Ranking and Consensus Formation," Management Science, INFORMS, vol. 24(16), pages 1721-1732, December.
- Wade D. Cook & Lawrence M. Seiford, 1982. "On the Borda-Kendall Consensus Method for Priority Ranking Problems," Management Science, INFORMS, vol. 28(6), pages 621-637, June.
- Michel Truchon & Stephen Gordon, 2006.
"Statistical Comparison of Aggregation Rules for Votes,"
Cahiers de recherche
- Truchon, Michel & Gordon, Stephen, 2009. "Statistical comparison of aggregation rules for votes," Mathematical Social Sciences, Elsevier, vol. 57(2), pages 199-212, March.
When requesting a correction, please mention this item's handle: RePEc:lvl:lacicr:0534. 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: (Manuel Paradis)
If references are entirely missing, you can add them using this form.