Pages that link to "Item:Q656822"
From MaRDI portal
The following pages link to Is computational complexity a barrier to manipulation? (Q656822):
Displaying 8 items.
- Solving hard control problems in voting systems via integer programming (Q322433) (← links)
- Computational complexity of manipulation: a survey (Q334204) (← links)
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- Manipulation can be hard in tractable voting systems even for constant-sized coalitions (Q465694) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? (Q2363601) (← links)
- Search versus Decision for Election Manipulation Problems (Q2957899) (← links)
- The Complexity of Controlling Condorcet, Fallback, and k-Veto Elections by Replacing Candidates or Voters (Q5042253) (← links)