How hard is bribery in elections?
From MaRDI portal
Publication:3651470
Recommendations
Cited in
(84)- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
- Approximating weighted and priced bribery in scoring rules
- Large-scale election campaigns: combinatorial shift bribery
- Studies in Computational Aspects of Voting
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
- Bribery and control in stable marriage
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Parameterized complexity of candidate control in elections and related digraph problems
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
- Computational complexity characterization of protecting elections from bribery
- On the complexity of bribery with distance restrictions
- Voting procedures, complexity of
- Complexity of shift bribery in committee elections
- The complexity of probabilistic lobbying
- The complexity of online bribery in sequential elections
- Isomorphic Distances Among Elections
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- Bribery in elections with randomly selected voters: hardness and algorithm
- Multivariate complexity analysis of swap bribery
- Heuristics for opinion diffusion via local elections
- Approximation and hardness of shift-bribery
- How hard is it to bribe the judges? A study of the complexity of bribery in judgment aggregation
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Complexity of shift bribery for iterative voting rules
- How hard is safe bribery?
- On the hardness of bribery variants in voting with CP-nets
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
- The complexity of priced control in elections
- Prices matter for the parameterized complexity of shift bribery
- The Complexity of Probabilistic Lobbying
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- The complexity of manipulative attacks in nearly single-peaked electorates
- Campaign management under approval-driven voting rules
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Comparing multiagent systems research in combinatorial auctions and voting
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Local distance constrained bribery in voting
- Parameterized complexity of control problems in Maximin election
- Protecting elections by recounting ballots
- Structural control in weighted voting games
- Algorithms for the coalitional manipulation problem
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
- On the complexity of bribery and manipulation in tournaments with uncertain information
- Election manipulation on social networks: seeding, edge removal, edge addition
- Dichotomy for pure scoring rules under manipulative electoral actions
- Is computational complexity a barrier to manipulation?
- Anyone but him: the complexity of precluding an alternative
- Parameterized computational complexity of control problems in voting systems
- Binary linear programming solutions and non-approximability for control problems in voting systems
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
- The number of parties and decision-making in legislatures
- Hardness and algorithms for electoral manipulation under media influence
- Priced gerrymandering
- Multivariate complexity analysis of Swap Bribery
- Swap bribery
- Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates
- Complexity of manipulative actions when voting with ties
- Search versus decision for election manipulation problems
- Manipulation and bribery when aggregating ranked preferences
- Distance rationalization of anonymous and homogeneous voting rules
- Weighted electoral control
- Control and bribery in voting
- scientific article; zbMATH DE number 7450032 (Why is no real title available?)
- Predicting winner and estimating margin of victory in elections using sampling
- Toward Computing the Margin of Victory in Single Transferable Vote Elections
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Parameterized analysis of bribery in \textit{Challenge the champ} tournaments
- Rationalizations of Condorcet-consistent rules via distances of Hamming type
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- How to tamper with a parliament: strategic campaigns in apportionment elections
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Path-disruption games: bribery and a probabilistic model
- Bribery in voting with CP-nets
- Voting and bribing in single-exponential time
- Normalized range voting broadly resists control
- Combinatorial \(n\)-fold integer programming and applications
- Complexity of conformant election manipulation
- Robustness of participatory budgeting outcomes: complexity and experiments
- Elections with few candidates: prices, weights, and covering problems
- How hard is bribery with distance restrictions?
- Frugal bribery in voting
This page was built for publication: How hard is bribery in elections?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651470)
