The following pages link to How Hard Is Bribery in Elections? (Q3651470):
Displaying 19 items.
- Search versus Decision for Election Manipulation Problems (Q2957899) (← links)
- Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control (Q3392307) (← links)
- Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control (Q3392309) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)
- Swap Bribery (Q3648865) (← links)
- Voting and bribing in single-exponential time (Q4636646) (← links)
- (Q5018515) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- Control and Bribery in Voting (Q5133010) (← links)
- Toward Computing the Margin of Victory in Single Transferable Vote Elections (Q5139621) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)
- Bribery and Control in Stable Marriage (Q5154751) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
- How hard is safe bribery? (Q6057829) (← links)
- Priced gerrymandering (Q6093576) (← links)
- Hardness and algorithms for electoral manipulation under media influence (Q6113911) (← links)
- Robustness of participatory budgeting outcomes: complexity and experiments (Q6546286) (← links)
- Complexity of conformant election manipulation (Q6546592) (← links)
