The complexity of online bribery in sequential elections

DOI10.1016/j.jcss.2022.01.006zbMath1483.68144arXiv1906.08308OpenAlexW4212796068MaRDI QIDQ2121471

Edith Hemaspaandra, Jörg Rothe, Hemaspaandra, Lane A.

Publication date: 4 April 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.08308

zbMATH Keywords

computational complexitylogiccomputational social choicebriberyquantifier assignmentsequential elections

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Logic in computer science (03B70) History, political science (91F10) Social choice (91B14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
• Manipulation complexity of same-system runoff elections
• Prices matter for the parameterized complexity of shift bribery
• New candidates welcome! Possible winners with respect to the addition of new candidates
• Campaign management under approval-driven voting rules
• The complexity of controlling candidate-sequential elections
• Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
• Dichotomy for voting systems
• A low and a high hierarchy within NP
• Reductions on NP and p-selective sets
• Single transferable vote resists strategic voting
• The theory of voting and equilibria in noncooperative games
• A comparison of polynomial time reducibilities
• The polynomial-time hierarchy
• Extending Condorcet's rule
• The computational difficulty of manipulating an election
• The complexity of online manipulation of sequential elections
• Large-Scale Election Campaigns: Combinatorial Shift Bribery
• Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
• When are elections with few candidates hard to manipulate?
• Swap Bribery
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• How Hard Is Bribery in Elections?
• Complexity Measures for Public-Key Cryptosystems
• Alternation
• Barriers to Manipulation in Voting
• Control and Bribery in Voting
• Handbook of Computational Social Choice

This page was built for publication: The complexity of online bribery in sequential elections