FrançaisEnglish

Érudit | Dépôt de documents >
CIRPÉE - Centre interuniversitaire sur le risque, les politiques économiques et l'emploi >
Cahiers de recherche du CIRPÉE >

Please use this identifier to cite or link to this item:

https://depot.erudit.org//id/002063dd

Title: Aggregation of Rankings: a Brief Review of Distance-Based Rules
Authors: Truchon, Michel
Keywords: Vote aggregation
Ranking rules
Distance
Loss function
Maximum likelihood
Optimal inference
Kemeny
Issue Date: 2005-12
Series/Report no.: Cahiers du CIRPÉE;05-34
Abstract: 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.
URI: http://132.203.59.36/CIRPEE/cahierscirpee/2005/files/CIRPEE05-34.pdf
https://depot.erudit.org/id/002063dd
Appears in Collections:Cahiers de recherche du CIRPÉE

Files in This Item:

CIRPEE05-34.pdf, (Adobe PDF ; 289.08 kB)

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

 

About Érudit | Subscriptions | RSS | Terms of Use | Contact us |

Consortium Érudit ©  2016