Pages that link to "Item:Q2436695"
From MaRDI portal
The following pages link to Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695):
Displayed 9 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control (Q314421) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Control of Condorcet voting: complexity and a relation-algebraic approach (Q319803) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718) (← links)
- On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834) (← links)