Probability calculations under the IAC hypothesis
DOI10.1016/j.mathsocsci.2007.05.003zbMath1141.91379arXiv1202.3493MaRDI QIDQ2463576
Geoffrey Pritchard, Mark C. Wilson
Publication date: 14 December 2007
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.3493
convex polytope; voting; social choice; Ehrhart quasipolynomial; impartial anonymous culture; counting lattice points in polyhedra
60D05: Geometric probability and stochastic geometry
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
52B55: Computational aspects related to convexity
91B12: Voting theory
60C05: Combinatorial probability
52A38: Length, area, volume and convex sets (aspects of convex geometry)
91B14: Social choice
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Which scoring rule maximizes condorcet efficiency under IAC?
- The proportion of coalitionally unstable situations under the plurality rule
- Condorcet efficiency and constant scoring rules
- The Condorcet efficiency of approval voting and the probability of electing the Condorcet loser
- The vulnerability of four social choice functions to coalitional manipulation of preferences
- The probability of conflicts in a U. S. presidential type election
- The minimum period of the Ehrhart quasi-polynomial of a rational polytope
- Condorcet's paradox and the likelihood of its occurrence: Different perspectives on balanced preferences
- On the probability that all decision rules select the same winner
- On the probability of electing the Condorcet loser
- Condorcet efficiency of simple voting rules for large electorates
- Exact results on manipulability of positional voting rules
- Analytical representation of probabilities under the IAC condition
- On Ehrhart polynomials and probability calculations in voting theory
- Some further results on the manipulability of social choice rules
- The many aspects of counting lattice points in polytopes
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- Computing the period of an Ehrhart quasi-polynomial
- Effective lattice point counting in rational convex polytopes
- Condorcet’s Paradox
- Scoring run-off paradoxes for variable electorates