Approximability of Dodgson's rule
From MaRDI portal
Publication:1024774
DOI10.1007/S00355-007-0282-8zbMATH Open1163.91344DBLPjournals/scw/McCabe-DanstedPS08OpenAlexW2047775021WikidataQ61586285 ScholiaQ61586285MaRDI QIDQ1024774FDOQ1024774
Authors: Geoffrey Pritchard, John Christopher McCabe-Dansted, Arkadii 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Voting schemes for which it can be difficult to tell who won the election
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tournament solutions and majority voting
- Independence of clones as a criterion for voting rules
- Exact analysis of Dodgson elections
- A comparison of Dodgson's method and the Borda count
- A comparison of Dodgson's method and Kemeny's rule
- Title not available (Why is that?)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- The Dodgson ranking and the Borda count: a binary comparison
Cited In (20)
- Parameterized computational complexity of Dodgson and Young elections
- Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
- A comparison of Dodgson's method and Kemeny's rule
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Parameterized Computational Complexity of Dodgson and Young Elections
- Frequency of correctness versus average polynomial time
- Collective decision making
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Lewis Carroll, voting, and the taxicab metric
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- Socially desirable approximations for dodgson’s voting rule
- Computational Aspects of Approval Voting
- Proportional Approval Voting, Harmonic k-median, and Negative Association
- Voting Procedures, Complexity of
- Beyond the worst case: semi-random complexity analysis of winner determination
- Title not available (Why is that?)
- On the approximability of Dodgson and Young elections
- Some Remarks on Dodgson's Voting Rule
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- A comparison of Dodgson's method and the Borda count
This page was built for publication: Approximability of Dodgson's rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024774)
