Control and bribery in voting
From MaRDI portal
Publication:5133010
DOI10.1017/CBO9781107446984.008zbMATH Open1452.91125OpenAlexW2488722845MaRDI QIDQ5133010FDOQ5133010
Authors: Piotr Faliszewski, Jörg Rothe 
Publication date: 12 November 2020
Full work available at URL: https://doi.org/10.1017/cbo9781107446984.008
Recommendations
- How hard is bribery in elections?
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Weighted electoral control
- Complexity of manipulative actions when voting with ties
Cited In (47)
- Parameterized complexity of voter control in multi-peaked elections
- Exploiting social influence to control elections based on positional scoring rules
- Bribery and control in stable marriage
- Parameterized resiliency problems
- Algorithms for gerrymandering over graphs
- A Parameterized Perspective on Attacking and Defending Elections
- Pervasive domination
- Computational complexity characterization of protecting elections from bribery
- On the complexity of bribery with distance restrictions
- 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
- Network-based vertex dissolution
- Election control through social influence with unknown preferences
- Collective decision making
- Approximation and hardness of shift-bribery
- Resolute control: forbidding candidates from winning an election is hard
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- How hard is safe bribery?
- Title not available (Why is that?)
- Complexity of shift bribery for iterative voting rules
- On the hardness of bribery variants in voting with CP-nets
- Election control through social influence with voters' uncertainty
- Local distance constrained bribery in voting
- Protecting elections by recounting ballots
- Structural control in weighted voting games
- Dark money in Congressional House elections
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
- The effect of iterativity on adversarial opinion forming
- Margin of victory for tournament solutions
- Priced gerrymandering
- Group control for consent rules with consecutive qualifications
- Distance restricted manipulation in voting
- Distributed monitoring of election winners
- How hard is bribery in elections?
- Multimode control attacks on elections
- Multi-winner Election Control via Social Influence
- Complexity of manipulative actions when voting with ties
- Weighted electoral control
- The nonmanipulative vote-deficits of voting rules
- Complexity of manipulative interference in participatory budgeting
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Path-disruption games: bribery and a probabilistic model
- Complexity of conformant election manipulation
- The complexity of controlling candidate-sequential elections
This page was built for publication: Control and bribery in voting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5133010)
