The following pages link to Swap Bribery (Q3648865):
Displaying 38 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)
- On the complexity of bribery with distance restrictions (Q1713407) (← 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)
- Protecting elections by recounting ballots (Q2046043) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- The possible winner problem with uncertain weights revisited (Q2140520) (← links)
- Combinatorial \(n\)-fold integer programming and applications (Q2205969) (← links)
- Local distance constrained bribery in voting (Q2215965) (← 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)
- Distributed monitoring of election winners (Q2289007) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Parameterized resiliency problems (Q2330129) (← 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)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- Robustness among multiwinner voting rules (Q5918366) (← links)
- Computational complexity characterization of protecting elections from bribery (Q5919119) (← links)
- How hard is safe bribery? (Q6057829) (← links)
- Priced gerrymandering (Q6093576) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)
