The following pages link to Algorithms and Computation (Q5897854):
Displaying 14 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Strategic voting in negotiating teams (Q2695442) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
