Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
From MaRDI portal
Recommendations
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
- Bribery in voting with CP-nets
- On the hardness of bribery variants in voting with CP-nets
- Computational complexity characterization of protecting elections from bribery
- Computational complexity characterization of protecting elections from bribery
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Parameterized complexity of control and bribery for \(d\)-approval elections
- Voting and bribing in single-exponential time
Cited in
(82)- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
- scientific article; zbMATH DE number 1024093 (Why is no real title available?)
- The possible winner with uncertain weights problem
- On making a distinguished vertex minimum degree by vertex deletion
- Studies in Computational Aspects of Voting
- Parameterized complexity of voter control in multi-peaked elections
- Extending tournament solutions
- Strategic candidacy equilibria for common voting rules
- Algorithms for gerrymandering over graphs
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
- 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
- When is the condition of order preservation met?
- Computational complexity characterization of protecting elections from bribery
- Complexity of manipulation with partial information in voting
- On the complexity of kings
- On the complexity of bribery with distance restrictions
- Voting procedures, complexity of
- The complexity of probabilistic lobbying
- The complexity of online bribery in sequential elections
- Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
- Inconsistency of special cases of pairwise comparisons matrices
- Control complexity in Bucklin and fallback voting: an experimental analysis
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control
- A solution for abstract decision problems based on maximum flow value
- Heuristic rating estimation: geometric approach
- Multivariate complexity analysis of swap bribery
- Complexity of control in judgment aggregation for uniform premise-based quota rules
- Copeland Voting Fully Resists Constructive Control
- On the computational complexity of variants of combinatorial voter control in elections
- Complexity of shift bribery for iterative voting rules
- Exact algorithms for weighted and unweighted Borda manipulation problems
- 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
- Control of Condorcet voting: complexity and a relation-algebraic approach
- Optimal defense against election control by deleting voter groups
- Prices matter for the parameterized complexity of shift bribery
- Fixed-parameter algorithms for Kemeny rankings
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions
- The complexity of manipulative attacks in nearly single-peaked electorates
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Microbribery in group identification
- Comparing multiagent systems research in combinatorial auctions and voting
- Solving hard control problems in voting systems via integer programming
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control
- Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems
- Local distance constrained bribery in voting
- Parameterized complexity of control problems in Maximin election
- A parameterized perspective on protecting elections
- Structural control in weighted voting games
- 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
- Dichotomy for pure scoring rules under manipulative electoral actions
- Towards quantification of incompleteness in the pairwise comparisons methods
- 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
- Gerrymandering on graphs: computational complexity and parameterized algorithms
- How hard is it to control an election?
- Towards a dichotomy for the possible winner problem in elections based on scoring rules
- Constraint-based electoral districting using a new compactness measure: an application to Portugal
- Margin of victory for tournament solutions
- On the evaluation of election outcomes under uncertainty
- Multivariate complexity analysis of Swap Bribery
- Multimode control attacks on elections
- Control and bribery in voting
- Control complexity in Bucklin and fallback voting: a theoretical analysis
- Robustness of approval-based multiwinner voting rules
- How to tamper with a parliament: strategic campaigns in apportionment elections
- Combinatorial voter control in 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
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey
- Normalized range voting broadly resists control
- Frugal bribery in voting
- On making a distinguished vertex of minimum degree by vertex deletion
This page was built for publication: Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3651465)
