Probability calculations under the IAC hypothesis
From MaRDI portal
Publication:2463576
convex polytopecounting lattice points in polyhedraEhrhart quasipolynomialimpartial anonymous culturesocial choicevoting
Length, area, volume and convex sets (aspects of convex geometry) (52A38) Computational aspects related to convexity (52B55) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorial probability (60C05) Geometric probability and stochastic geometry (60D05) Voting theory (91B12) Social choice (91B14)
Abstract: 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.
Recommendations
- Exploiting polyhedral symmetries in social choice
- An example of probability computations under the IAC assumption: the stability of scoring rules
- scientific article; zbMATH DE number 878682
- On Ehrhart polynomials and probability calculations in voting theory
- Computations of volumes and Ehrhart series in four candidates elections
Cites work
- Analytical representation of probabilities under the IAC condition
- Computing the period of an Ehrhart quasi-polynomial
- Condorcet efficiency and constant scoring rules
- Condorcet efficiency of simple voting rules for large electorates
- Condorcet's paradox and the likelihood of its occurrence: Different perspectives on balanced preferences
- Condorcet’s Paradox
- Effective lattice point counting in rational convex polytopes
- Exact results on manipulability of positional voting rules
- scientific article; zbMATH DE number 992411 (Why is no real title available?)
- scientific article; zbMATH DE number 1538124 (Why is no real title available?)
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- On Ehrhart polynomials and probability calculations in voting theory
- On the probability of electing the Condorcet loser
- On the probability that all decision rules select the same winner
- Scoring run-off paradoxes for variable electorates
- Some further results on the manipulability of social choice rules
- The Condorcet efficiency of approval voting and the probability of electing the Condorcet loser
- The many aspects of counting lattice points in polytopes
- The minimum period of the Ehrhart quasi-polynomial of a rational polytope
- The probability of conflicts in a U. S. presidential type election
- The proportion of coalitionally unstable situations under the plurality rule
- The vulnerability of four social choice functions to coalitional manipulation of preferences
- Which scoring rule maximizes condorcet efficiency under IAC?
Cited in
(34)- Asymptotics of the minimum manipulating coalition size for positional voting rules under impartial culture behaviour
- Asymptotic vulnerability of positional voting rules to coalitional manipulation
- Monotonicity paradoxes in three-candidate elections using scoring elimination rules
- Majority properties of positional social preference correspondences
- On the Condorcet efficiency of evaluative voting (and other voting rules) with trichotomous preferences
- Manipulable outcomes within the class of scoring voting rules
- Computations of volumes and Ehrhart series in four candidates elections
- Probabilities of electoral outcomes: from three-candidate to four-candidate elections
- On Dedekind's problem for complete simple games
- Analytical representation of probabilities under the IAC condition
- On Ehrhart polynomials and probability calculations in voting theory
- Exploiting polyhedral symmetries in social choice
- On the likelihood of dummy players in weighted majority games
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- Consistent collective decisions under majorities based on difference of votes
- A note on approval voting and electing the Condorcet loser
- Exploiting symmetries in polyhedral computations
- Correlation, partitioning and the probability of casting a decisive vote under the majority rule
- Are Condorcet procedures so bad according to the reinforcement axiom?
- Voting with rubber bands, weights, and strings
- An example of probability computations under the IAC assumption: the stability of scoring rules
- The impact of voters' preference diversity on the probability of some electoral outcomes
- The computation of generalized Ehrhart series in normaliz
- scientific article; zbMATH DE number 878682 (Why is no real title available?)
- Strategic manipulability of self-selective social choice rules
- Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox
- Exploring the No-Show Paradox for Condorcet Extensions
- IAC Probability Calculations in Voting Theory: Progress Report
- Three ways to compute accurately the probability of the referendum paradox
- Social unacceptability for simple voting procedures
- Condorcet-consistent choice among three candidates
- Social acceptability of Condorcet committees
- On the probability of observing Borda's paradox
- On the positive association of parliamentary social choice functions
This page was built for publication: Probability calculations under the IAC hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2463576)