A new perspective on implementation by voting trees
From MaRDI portal
Publication:5198671
DOI10.1002/rsa.20336zbMath1218.91039OpenAlexW2099306112MaRDI QIDQ5198671
Ariel D. Procaccia, Felix Fischer, Alex Samorodnitsky
Publication date: 9 August 2011
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20336
Voting theory (91B12) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Social choice (91B14)
Related Items
Cites Work
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
- Algorithms for the coalitional manipulation problem
- The learnability of voting rules
- A topological approach to evasiveness
- Sophisticated voting outcomes and agenda control
- Choosing from a tournament
- Stronger players win more balanced knockout tournaments
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Implementation via backward induction
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- A multistage game representation of sophisticated voting for binary procedures
- The Copeland measure of Condorcet choice functions
- The computational difficulty of manipulating an election
- Sophisticated voting rules: The case of two tournaments
- Implementing generalized Condorcet social choice functions via backward induction
- Even-chance lotteries in social choice theory
- The Computational Complexity of Choice Sets
- When are elections with few candidates hard to manipulate?
- Manipulation of Voting Schemes: A General Result
- Manipulation of Schemes that Mix Voting with Chance
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
This page was built for publication: A new perspective on implementation by voting trees
