×

Probability calculations under the IAC hypothesis. (English) Zbl 1141.91379

Summary: We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given.

MSC:

91B14 Social choice
52A38 Length, area, volume and convex sets (aspects of convex geometry)
52B55 Computational aspects related to convexity
52C07 Lattices and convex bodies in \(n\) dimensions (aspects of discrete geometry)
60C05 Combinatorial probability
60D05 Geometric probability and stochastic geometry
91B12 Voting theory

Software:

LattE
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Büeler, Benno; Enge, Andreas; Fukuda, Komei, Exact volume computation for polytopes: a practical study, (Polytopes-combinatorics and computation (Oberwolfach, 1997), volume 29 of DMV Sem. (2000), Birkhauser: Birkhauser Basel), 131-154 · Zbl 0960.68162
[2] Cervone, Davide P.; Gehrlein, William V.; Zwicker, William S., Which scoring rule maximizes Condorcet efficiency under IAC?, Theory Decis., 58, 2, 145-185 (2005) · Zbl 1126.91017
[3] Convex homepage at http://www-fourier-ujf-grenoble.fr/ franz/convex/; Convex homepage at http://www-fourier-ujf-grenoble.fr/ franz/convex/
[4] De Loera, Jesús A., The many aspects of counting lattice points in polytopes, Math. Semesterber., 52, 2, 175-195 (2005) · Zbl 1093.52006
[5] De Loera, Jesús A.; Hemmecke, Raymond; Tauzer, Jeremiah; Yoshida, Ruriko, Effective lattice point counting in rational convex polytopes, J. Symbol. Comput., 38, 4, 1273-1302 (2004) · Zbl 1137.52303
[6] Favardin, P.; Lepelley, D., Some further results on the manipulability of social choice rules, Soc. Choice Welf., 26, 3, 485-509 (2006) · Zbl 1098.91032
[7] Feix, Marc R.; Lepelley, Dominique; Merlin, Vincent R.; Rouet, Jean-Louis, The probability of conflicts in a U.S. presidential type election, Econom. Theory, 23, 2, 227-257 (2004) · Zbl 1128.91316
[8] Gehrlein, William V., Condorcet efficiency and constant scoring rules, Math. Soc. Sci., 2, 123-130 (1982) · Zbl 0479.90015
[9] Gehrlein, William V., Condorcet efficiency of simple voting rules for large electorates, Econ. Lett., 4, 61-66 (1992) · Zbl 0772.90023
[10] Gehrlein, William V., Condorcet’s paradox and the Condorcet efficiency of voting rules, Math. Jpn., 45, 1, 173-199 (1997) · Zbl 0869.90013
[11] Gehrlein, William V., Condorcet’s paradox and the likelihood of its occurrence: different perspectives on balanced preferences, Theory Decis., 52, 2, 171-199 (2002) · Zbl 1030.91500
[12] Gehrlein, William V., Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic, Soc. Choice Welf., 19, 3, 503-512 (2002) · Zbl 1072.91530
[13] Gehrlein, William V., Condorcet’s Paradox (2006), Springer, 289 pp. · Zbl 1122.91027
[14] Gehrlein, William V.; Lepelley, Dominique, Probability calculations in voting theory: an overview of recent results, (Reasoned Choices: Essays in Honor of Academy Professor Hannu Nurmi (2004)) · Zbl 0953.91006
[15] Huang, H. C.; Chua, Vincent C. H., Analytical representation of probabilities under the IAC condition, Soc. Choice Welf., 17, 1, 143-155 (2000) · Zbl 1069.91529
[16] LattE homepage at http://www.math.ucdavis.edu/ latte; LattE homepage at http://www.math.ucdavis.edu/ latte
[17] Lepelley, Dominique, On the probability of electing the Condorcet loser, Math. Social Sci., 25, 2, 105-116 (1993) · Zbl 0769.90026
[18] Lepelley, Dominique; Mbih, Boniface, The proportion of coalitionally unstable situations under the plurality rule, Econ. Lett., 24, 4, 311-315 (1987) · Zbl 1328.91073
[19] Lepelley, Dominique; Mbih, Boniface, The vulnerability of four social choice functions to coalitional manipulation of preferences, Soc. Choice Welf., 11, 3, 253-265 (1994) · Zbl 0822.90006
[20] Lepelley, Dominique; Merlin, Vincent, Scoring run-off paradoxes for variable electorates, Econ. Theory, 17, 1, 53-80 (2001) · Zbl 0984.91030
[21] Dominique Lepelley, Ahmed Louichi and Hatem Smaoui. On Ehrhart polynomials and probability calculations in voting theory. Preprint, 2006 (20 pages).; Dominique Lepelley, Ahmed Louichi and Hatem Smaoui. On Ehrhart polynomials and probability calculations in voting theory. Preprint, 2006 (20 pages). · Zbl 1149.91028
[22] Maple computer algebra system, available from http://www.maplesoft.com/; Maple computer algebra system, available from http://www.maplesoft.com/
[23] McAllister, Tyrrell B.; Woods, Kevin M., The minimum period of the Ehrhart quasi-polynomial of a rational polytope, J. Comb. Theory, Ser. A, 109, 345-352 (2005) · Zbl 1063.52006
[24] Merlin, V.; Tataru, M.; Valognes, F., On the probability that all decision rules select the same winner, J. Math. Econom., 33, 2, 183-207 (2000) · Zbl 0938.91017
[25] Geoffrey Pritchard and Mark C. Wilson. Exact results on manipulability of positional voting rules. Soc. Choice Welf., to appear.; Geoffrey Pritchard and Mark C. Wilson. Exact results on manipulability of positional voting rules. Soc. Choice Welf., to appear. · Zbl 1180.91097
[26] vinci homepage at http://www.lix.polytechnique.fr/Labo/Andreas.Enge/Vinci.html; vinci homepage at http://www.lix.polytechnique.fr/Labo/Andreas.Enge/Vinci.html
[27] Woods, Kevin. Computing the period of an Ehrhart quasi-polynomial. Electron. J. Combin., 12:Research Paper 34, 12 pp. (electronic), 2005.; Woods, Kevin. Computing the period of an Ehrhart quasi-polynomial. Electron. J. Combin., 12:Research Paper 34, 12 pp. (electronic), 2005. · Zbl 1076.05005
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.