Probabilities of electoral outcomes: from three-candidate to four-candidate elections

The main purpose of this paper is to compute the theoretical likelihood of some electoral outcomes under the impartial anonymous culture in four-candidate elections by using the last versions of software like LattE or Normaliz. By comparison with the three-candidate case, our results allow to analyze the impact of the number of candidates on the occurrence of these voting outcomes.

[1]  Felix Brandt,et al.  Analyzing the Practical Relevance of Voting Paradoxes via Ehrhart Theory, Computer Simulations, and Empirical Data , 2016, AAMAS.

[2]  Daniela Bubboloni,et al.  Extensions of the Simpson voting rule to the committee selection setting , 2019, Public Choice.

[3]  H. Moulin.  Axioms of Cooperative Decision Making , 1988 .

[4]  Achill Schurmann.  Exploiting Polyhedral Symmetries in Social Choice , 2011 .

[5]  W. Gehrlein.  Condorcet's paradox , 1983 .

[6]  Geoffrey Pritchard,et al.  Probability calculations under the IAC hypothesis , 2007, Math. Soc. Sci..

[7]  William V. Gehrlein.  Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic , 2002, Soc. Choice Welf..

[8]  Peter C. Fishburn,et al.  The probability of the paradox of voting: A computable solution , 1976 .

[9]  Jesús A. De Loera,et al.  Effective lattice point counting in rational convex polytopes , 2004, J. Symb. Comput..

[10]  Winfried Bruns,et al.  The computation of generalized Ehrhart series in Normaliz , 2012, J. Symb. Comput..

[11]  Dominique Lepelley,et al.  The proportion of coalitionally unstable situations under the plurality rule , 1987 .

[12]  Eric Kamwa,et al.  A Note on the Likelihood of the Absolute Majority Paradoxes , 2018 .

[13]  D. Lepelley,et al.  Contribution a l'analyse des procedures de decision collective , 1989 .

[14]  Achill Schürmann,et al.  Exploiting polyhedral symmetries in social choice , 2011, Soc. Choice Welf..

[15]  William V. Gehrlein,et al.  An Evaluation of the Benefit of Using Two-Stage Election Procedures , 2018 .

[16]  Bogdan Ichim,et al.  Computations of volumes and Ehrhart series in four candidates elections , 2019, Ann. Oper. Res..

[17]  Dominique Lepelley,et al.  On Ehrhart polynomials and probability calculations in voting theory , 2008, Soc. Choice Welf..

[18]  Vincent C. H. Chua,et al.  Analytical representation of probabilities under the IAC condition , 2000, Soc. Choice Welf..

[19]  Ahmed Doghmi,et al.  Multi-winner scoring election methods: Condorcet consistency and paradoxes , 2016, Public Choice.

[20]  A. Barvinok.  A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1994 .

[21]  William V. Gehrlein,et al.  Voting Paradoxes and Group Coherence , 2011 .

[22]  Maurice Bruynooghe,et al.  Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical Comparison , 2008, ITSL.

[23]  Vincent Loechner,et al.  Parametric Analysis of Polyhedral Iteration Spaces , 1998, J. VLSI Signal Process..

[24]  William V. Gehrlein,et al.  Elections, Voting Rules and Paradoxical Outcomes , 2017 .

[25]  William V. Gehrlein,et al.  Condorcet winners on four candidates with anonymous voters , 2001 .

[26]  Jesús A. De Loera,et al.  Software for exact integration of polynomials over polyhedra , 2011, ACCA.