A Richer Understanding of the Complexity of Election Systems
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg, Rothe
TL;DR
This paper reviews recent advances in understanding the computational complexity of election systems, focusing on winner determination, manipulation, bribery, and control problems.
Contribution
It offers a comprehensive overview of recent progress in analyzing the computational complexity of various election-related problems.
Findings
Complexity results for winner determination
Insights into manipulation and bribery problems
Analysis of control problems in election systems
Abstract
We provide an overview of some recent progress on the complexity of election systems. The issues studied include the complexity of the winner, manipulation, bribery, and control problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Internet Traffic Analysis and Secure E-voting · Auction Theory and Applications