Barriers to Manipulation in Voting
From MaRDI portal
Publication:5133009
DOI10.1017/CBO9781107446984.007zbMATH Open1448.91097OpenAlexW2500719051MaRDI QIDQ5133009FDOQ5133009
Publication date: 12 November 2020
Full work available at URL: https://doi.org/10.1017/cbo9781107446984.007
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cited In (23)
- A Parameterized Perspective on Attacking and Defending Elections
- Obvious manipulability of voting rules
- The complexity of online bribery in sequential elections
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- How hard is safe bribery?
- Complexity of shift bribery for iterative voting rules
- Manipulation complexity of same-system runoff elections
- On the hardness of bribery variants in voting with CP-nets
- Approximation and hardness of shift-Bribery
- Local distance constrained bribery in voting
- Protecting elections by recounting ballots
- Structural control in weighted voting games
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- Manipulation of voting schemes with restricted beliefs
- Measuring violations of positive involvement in voting
- Title not available (Why is that?)
- Strategyproof judgment aggregation under partial information
- Priced gerrymandering
- Distance restricted manipulation in voting
- Strategic voting in the context of stable-matching of teams
- Strategic voting in negotiating teams
- A note on the complexity of manipulating weighted Schulze voting
This page was built for publication: Barriers to Manipulation in Voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133009)
