Exploiting polyhedral symmetries in social choice

A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption is via counting integral points in polyhedra. Here, Ehrhart theory can help, but unfortunately the dimension and complexity of the involved polyhedra grows rapidly with the number of candidates. However, if we exploit available polyhedral symmetries, some computations become possible that previously were infeasible. We show this in three well known examples: Condorcet’s paradox, Condorcet efficiency of plurality voting and in Plurality voting vs Plurality Runoff.

[1]  Komei Fukuda,et al.  Exact volume computation for polytopes: a practical study , 1996 .

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

[3]  S. Berg,et al.  A note on the paradox of voting: Anonymous preference profiles and May's formula , 1983 .

[4]  Achill Schürmann,et al.  C++ Tools for Exploiting Polyhedral Symmetries , 2010, ICMS.

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

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

[7]  William V. Gehrlein.  Condorcet efficiency and constant scoring rules , 1982, Math. Soc. Sci..

[8]  Alexander I. Barvinok,et al.  A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed , 1993, FOCS.

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

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

[11]  Martin E. Dyer,et al.  On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[12]  Alexander Barvinok,et al.  Integer Points in Polyhedra , 2008 .

[13]  F. Tabak,et al.  Counting lattice points in polyhedra using the Ehrhart theory, applied to Voting theory , 2010 .

[14]  Jesús A. De Loera,et al.  Computation of the Highest Coefficients of Weighted Ehrhart Quasi-polynomials of Rational Polyhedra , 2010, Found. Comput. Math..

[15]  Jesús A. De Loera,et al.  How to integrate a polynomial over a simplex , 2008, Math. Comput..

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

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

[18]  S. Robins,et al.  Computing the Continuous Discretely , 2015 .

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

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

[21]  L. A. Goodman,et al.  Social Choice and Individual Values , 1951 .

[22]  Michael Joswig,et al.  polymake: a Framework for Analyzing Convex Polytopes , 2000 .

[23]  William J. Cook,et al.  On integer points in polyhedra , 1992, Comb..

[24]  Murray Schechter,et al.  INTEGRATION OVER A POLYHEDRON : AN APPLICATION OF THE FOURIER-MOTZKIN ELIMINATION METHOD , 1998 .