The following pages link to Approximability of Dodgson's rule (Q1024774):
Displaying 17 items.
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- A comparison of Dodgson's method and the Borda count (Q1865217) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
- A comparison of Dodgson's method and Kemeny's rule (Q2388786) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Computational Aspects of Approval Voting (Q2829683) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
- Some Remarks on Dodgson's Voting Rule (Q3392311) (← links)
- Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)
- Collective decision making (Q6602233) (← links)
