The following pages link to (Q3579475):
Displaying 5 items.
- Computational complexity of manipulation: a survey (Q334204) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- The learnability of voting rules (Q840821) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)