A Richer Understanding of the Complexity of Election Systems
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg Rothe
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.
Create a lesson
Related papers
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar et al.
Token-Level Advertising
Hanbing Liu, Bowei Zhang, Changyuan Yu et al.
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
Robust Lottery Compression for Metric Voting: A Transfer Principle for Bounded Randomness
Jianhao Jia, Bo Peng
A lone divider allocation algorithm with subjective divisibility
Uriel Feige
Trusting AI in Competitive Markets
Jussi Keppo, Yuze Li, Gerry Tsoukalas et al.