The following pages link to (Q3093654):
Displayed 11 items.
- Manipulation complexity of same-system runoff elections (Q314418) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Is computational complexity a barrier to manipulation? (Q656822) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Isomorphic Distances Among Elections (Q5042228) (← links)
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)