The Complexity of Online Bribery in Sequential Elections (Extended Abstract)

Preprint English OPEN
Hemaspaandra, Edith; Hemaspaandra, Lane A.; Rothe, Jörg;
(2019)
  • Related identifiers: doi: 10.4204/EPTCS.297.16
  • Subject: Computer Science - Multiagent Systems | Computer Science - Computer Science and Game Theory | Computer Science - Computational Complexity

Prior work on the complexity of bribery assumes that the bribery happens simultaneously, and that the briber has full knowledge of all voters' votes. But neither of those assumptions always holds. In many real-world settings, votes come in sequentially, and the briber m... View more
Share - Bookmark