The following pages link to How Hard Is Bribery in Elections? (Q3651470):
Displaying 50 items.
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- The complexity of priced control in elections (Q314424) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems (Q391210) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Frugal bribery in voting (Q527399) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Parameterized complexity of control problems in Maximin election (Q656582) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections (Q722093) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners (Q835761) (← links)
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461) (← links)
- Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules (Q898752) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Anyone but him: the complexity of precluding an alternative (Q1028907) (← links)
- Parameterized computational complexity of control problems in voting systems (Q1029347) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- The complexity of probabilistic lobbying (Q1662102) (← links)
- On the complexity of bribery with distance restrictions (Q1713407) (← links)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Protecting elections by recounting ballots (Q2046043) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
- Approximation and hardness of shift-Bribery (Q2238694) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Parameterized complexity of control and bribery for \(d\)-approval elections (Q2354767) (← links)
- Distance rationalization of anonymous and homogeneous voting rules (Q2417418) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Rationalizations of Condorcet-consistent rules via distances of Hamming type (Q2450151) (← links)
- The number of parties and decision-making in legislatures (Q2669117) (← links)
- Large-scale election campaigns: combinatorial shift bribery (Q2800947) (← links)
- Parameterized Complexity of Control and Bribery for d-Approval Elections (Q2867125) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Bypassing Combinatorial Protections: Polynomial-Time Algorithms for Single-Peaked Electorates (Q2941740) (← links)
