Pages that link to "Item:Q835761"
From MaRDI portal
The following pages link to Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761):
Displayed 12 items.
- Generalized juntas and NP-hard sets (Q837194) (← links)
- Approximability of Dodgson's rule (Q1024774) (← links)
- On the approximability of Dodgson and Young elections (Q1761290) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← 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)
- Proportional Approval Voting, Harmonic k-median, and Negative Association (Q5002696) (← links)
- Socially desirable approximations for dodgson’s voting rule (Q5501960) (← links)
- Beyond the worst case: semi-random complexity analysis of winner determination (Q6167260) (← links)