Approximability of Dodgson's rule
From MaRDI portal
Publication:1024774
DOI10.1007/s00355-007-0282-8zbMath1163.91344OpenAlexW2047775021WikidataQ61586285 ScholiaQ61586285MaRDI QIDQ1024774
Geoffrey Pritchard, John C. McCabe-Dansted, Arkadii M. Slinko
Publication date: 17 June 2009
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-007-0282-8
Related Items (12)
Beyond the worst case: semi-random complexity analysis of winner determination ⋮ Parameterized Computational Complexity of Dodgson and Young Elections ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ Proportional Approval Voting, Harmonic k-median, and Negative Association ⋮ Voting Procedures, Complexity of ⋮ On the approximability of Dodgson and Young elections ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Frequency of correctness versus average polynomial time ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control ⋮ Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control ⋮ Computational Aspects of Approval Voting ⋮ Socially desirable approximations for dodgson’s voting rule
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence of clones as a criterion for voting rules
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Voting schemes for which it can be difficult to tell who won the election
- Tournament solutions and majority voting
- A comparison of Dodgson's method and the Borda count
- The Dodgson ranking and the Borda count: a binary comparison
- A comparison of Dodgson's method and Kemeny's rule
- Exact analysis of Dodgson elections
This page was built for publication: Approximability of Dodgson's rule
