Maximum Likelihood Approach to Vote Aggregation with Variable Probabilities
AbstractCondorcet (1785) initiated the statistical approach to vote aggregation. Two centuries later, Young (1988) showed that a correct application of the maximum likelihood principle leads to the selection of rankings called Kemeny orders, which have the minimal total number of disagreements with those of the voters. The Condorcet-Kemeny-Yoiung approach is based on the assumption that the voters have the same probability of comparing correctly two alternatives and that this probability is the same for any pair of alternatives. We relax the second part of this assumption by letting the probability of comparing correctly two alternatives be increasing with the distance between two alternatives in the allegedly true ranking. This leads to a rule in which the majority in favor of one alternative against another one is given a larger weight the larger the distance between the two alternatives in the true ranking, i.e. the larger the probability that the voters compare them correctly. This rule is not Condorcet consistent. Thus, it may be different from the Kemeny rule. Yet, it is anonymous, neutral, and paretian. However, contrary to the Kemeny rule, it does not satisfy Young and Levenglick (1978)'s local independence of irrelevant alternatives. Condorcet also hinted that the Condorcet winner or the top alternative in the Condorcet ranking is not necessarily most likely to be the best. Young confirms that indeed with a constant probability close to 1/2, this alternative is the Borda winner while it is the alternative whose smallest majority is the largest when the probability is close to 1. We extend his analysis to the case of variable probabilities. Young's result implies that the Kemeny rule does not necessarily select the alternative most likely to be the best. A natural question that comes to mind is whether the rule obtained with variable probabilities does better than the Kemeny rule in this respect. It appears that this performance imporves with the rate at which the probability increases.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Université Laval - Département d'économique in its series Cahiers de recherche with number 0211.
Date of creation: 2002
Date of revision:
Vote Aggregation; Kemeny Rule; Maximum Likelihood; Variable Probabilities;
Other versions of this item:
- Mohamed Drissi-Bakhkhat & Michel Truchon, 2004. "Maximum likelihood approach to vote aggregation with variable probabilities," Social Choice and Welfare, Springer, vol. 23(2), pages 161-185, October.
- NEP-ALL-2003-04-09 (All new papers)
- NEP-CDM-2003-04-09 (Collective Decision-Making)
- NEP-DCM-2003-04-09 (Discrete Choice Models)
- NEP-ECM-2003-04-12 (Econometrics)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Pivato, Marcus, 2011.
"Voting rules as statistical estimators,"
30292, University Library of Munich, Germany.
- Truchon, Michel, 2004.
"Aggregation of Rankings in Figure Skating,"
Cahiers de recherche
0402, Université Laval - Département d'économique.
- Conitzer, Vincent, 2012. "Should social network structure be taken into account in elections?," Mathematical Social Sciences, Elsevier, vol. 64(1), pages 100-102.
- Michel Truchon, 2006.
"Borda and the Maximum Likelihood Approach to Vote Aggregation,"
Cahiers de recherche
- Truchon, Michel, 2008. "Borda and the maximum likelihood approach to vote aggregation," Mathematical Social Sciences, Elsevier, vol. 55(1), pages 96-102, January.
- Truchon, Michel & Gordon, Stephen, 2009.
"Statistical comparison of aggregation rules for votes,"
Mathematical Social Sciences,
Elsevier, vol. 57(2), pages 199-212, March.
- Michel Truchon & Stephen Gordon, 2006. "Statistical Comparison of Aggregation Rules for Votes," Cahiers de recherche 0625, CIRPEE.
- Jean-François Laslier, 2009. "In Silico Voting Experiments," Working Papers hal-00390376, HAL.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Johanne Perron).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.