Exploiting polyhedral symmetries in social choice
From MaRDI portal
Publication:2452242
DOI10.1007/s00355-012-0667-1zbMath1288.91076arXiv1109.1545OpenAlexW2091420732MaRDI QIDQ2452242
Publication date: 2 June 2014
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1545
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Voting theory (91B12) Social choice (91B14)
Related Items
Polytope volume by descent in the face lattice and applications in social choice, From Gehrlein-Fishburn’s Method on Frequency Representation to a Direct Proof of Ehrhart’s extended Conjecture, IAC Probability Calculations in Voting Theory: Progress Report, Normaliz 2013–2016, On the Condorcet efficiency of evaluative voting (and other voting rules) with trichotomous preferences, On the score sheets of a round-robin football tournament, Asymptotic vulnerability of positional voting rules to coalitional manipulation, Polytope volume in Normaliz, The power of pyramid decomposition in Normaliz, The likelihood of a Condorcet winner in the logrolling setting, The computation of generalized Ehrhart series in normaliz, 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, How to compute the Stanley depth of a module, Exploiting Symmetries in Polyhedral Computations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Voting paradoxes and group coherence. The Condorcet efficiency of voting rules.
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Integer points in polyhedra
- Condorcet efficiency and constant scoring rules
- The probability of the paradox of voting: A computable solution
- Software for exact integration of polynomials over polyhedra
- Analytical representation of probabilities under the IAC condition
- On Ehrhart polynomials and probability calculations in voting theory
- Probability calculations under the IAC hypothesis
- Obtaining representations for probabilities of voting outcomes with effectively unlimited precision integer arithmetic
- How to integrate a polynomial over a simplex
- Computing the Continuous Discretely
- Mathematics and Politics
- On the Complexity of Computing the Volume of a Polyhedron
- Integration over a Polyhedron: An Application of the Fourier-Motzkin Elimination Method
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
- C++ Tools for Exploiting Polyhedral Symmetries
- Condorcet winners on four candidates with anonymous voters
