The following pages link to Swap Bribery (Q3648865):
Displayed 19 items.
- 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)
- Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules (Q413279) (← links)
- New candidates welcome! Possible winners with respect to the addition of new candidates (Q449052) (← 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)
- 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)
- Multivariate complexity analysis of Swap Bribery (Q1759677) (← links)
- Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Bribery in voting with CP-nets (Q2436697) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Multivariate Complexity Analysis of Swap Bribery (Q3058696) (← links)
- Often Harder than in the Constructive Case: Destructive Bribery in CP-nets (Q3460798) (← links)