The following pages link to Approximability of Dodgson's rule (Q1024774):
Displaying 11 items.
- Frequency of correctness versus average polynomial time (Q989533) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← 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)
- 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)
