Barriers to Manipulation in Voting
From MaRDI portal
Publication:5133009
DOI10.1017/cbo9781107446984.007zbMath1448.91097OpenAlexW2500719051MaRDI QIDQ5133009
Publication date: 12 November 2020
Full work available at URL: https://doi.org/10.1017/cbo9781107446984.007
Voting theory (91B12) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (21)
The complexity of online bribery in sequential elections ⋮ A Parameterized Perspective on Attacking and Defending Elections ⋮ Manipulation complexity of same-system runoff elections ⋮ On the hardness of bribery variants in voting with CP-nets ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules ⋮ How hard is safe bribery? ⋮ Priced gerrymandering ⋮ Strategic voting in the context of stable-matching of teams ⋮ Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules ⋮ A note on the complexity of manipulating weighted Schulze voting ⋮ Obvious manipulability of voting rules ⋮ Strategic voting in negotiating teams ⋮ Unnamed Item ⋮ Local distance constrained bribery in voting ⋮ Distance restricted manipulation in voting ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Approximation and hardness of shift-Bribery ⋮ Protecting elections by recounting ballots ⋮ Strategyproof judgment aggregation under partial information ⋮ Complexity of shift bribery for iterative voting rules ⋮ Structural control in weighted voting games
This page was built for publication: Barriers to Manipulation in Voting
