Control and Bribery in Voting

From MaRDI portal
Publication:5133010

DOI10.1017/cbo9781107446984.008zbMath1452.91125OpenAlexW2488722845MaRDI QIDQ5133010

Piotr Faliszewski, Jörg Rothe

Publication date: 12 November 2020

Full work available at URL: https://doi.org/10.1017/cbo9781107446984.008




Related Items (38)

The complexity of online bribery in sequential electionsA Parameterized Perspective on Attacking and Defending ElectionsThe Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or VotersAlgorithms for gerrymandering over graphsResolute control: forbidding candidates from winning an election is hardOn the hardness of bribery variants in voting with CP-netsElection control through social influence with voters' uncertaintyComplexity of control in judgment aggregation for uniform premise-based quota rulesMulti-winner Election Control via Social InfluenceHow hard is safe bribery?NP-hardness of two edge cover generalizations with applications to control and bribery for approval votingPriced gerrymanderingGroup control for consent rules with consecutive qualificationsPervasive dominationThe effect of iterativity on adversarial opinion formingThe nonmanipulative vote-deficits of voting rulesComplexity of manipulative interference in participatory budgetingOn the complexity of bribery with distance restrictionsLocal distance constrained bribery in votingDistance restricted manipulation in votingControl complexity in Borda elections: solving all open cases of offline control and some cases of online controlApproximation and hardness of shift-BriberyBribery and Control in Stable MarriagePath-disruption games: bribery and a probabilistic modelThe complexity of controlling candidate-sequential electionsControl complexity in Bucklin and fallback voting: a theoretical analysisElection control through social influence with unknown preferencesDistributed monitoring of election winnersComputational complexity characterization of protecting elections from briberyProtecting elections by recounting ballotsMixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and votingMargin of victory for tournament solutionsParameterized complexity of voter control in multi-peaked electionsParameterized resiliency problemsNetwork-Based Vertex DissolutionComplexity of shift bribery for iterative voting rulesStructural control in weighted voting gamesExploiting social influence to control elections based on positional scoring rules




This page was built for publication: Control and Bribery in Voting