Pages that link to "Item:Q2256718"
From MaRDI portal
The following pages link to Control complexity in Bucklin and fallback voting: an experimental analysis (Q2256718):
Displaying 11 items.
- Campaign management under approval-driven voting rules (Q513294) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)
