Algorithms and Computation
From MaRDI portal
Publication:5897854
DOI10.1007/11602613zbMath1173.91350OpenAlexW2304246803MaRDI QIDQ5897854
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (14)
Algorithms for the coalitional manipulation problem ⋮ Manipulation complexity of same-system runoff elections ⋮ Optimal defense against election control by deleting voter groups ⋮ Comparing multiagent systems research in combinatorial auctions and voting ⋮ Strategic voting in negotiating teams ⋮ Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey ⋮ The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem ⋮ Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Is computational complexity a barrier to manipulation? ⋮ Control complexity in Bucklin and fallback voting: a theoretical analysis ⋮ Game authority for robust and scalable distributed selfish-computer systems ⋮ Computer science and decision theory ⋮ Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
This page was built for publication: Algorithms and Computation
