Pages that link to "Item:Q452827"
From MaRDI portal
The following pages link to The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem (Q452827):
Displaying 18 items.
- A quantitative Gobbard-Satterthwaite theorem without neutrality (Q343234) (← links)
- Normalized range voting broadly resists control (Q385502) (← links)
- Between Arrow and Gibbard-Satterthwaite. A representation theoretic approach (Q466073) (← links)
- Generalizing the Gibbard-Satterthwaite theorem: partial preferences, the degree of manipulation, and multi-valuedness (Q647541) (← links)
- A tight quantitative version of Arrow's impossibility theorem (Q713951) (← links)
- Minimally manipulable anonymous social choice functions (Q997202) (← links)
- Permutation cycles and manipulation of choice functions (Q1083004) (← links)
- A new informational base for social choice (Q1124505) (← links)
- On the likelihood of single-peaked preferences (Q1704048) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- A quantitative Arrow theorem (Q1930856) (← links)
- The probability of intransitivity in dice and close elections (Q2210747) (← links)
- A law of large numbers for weighted plurality (Q2247943) (← links)
- Control complexity in Bucklin and fallback voting: a theoretical analysis (Q2256717) (← links)
- Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey (Q2436695) (← links)
- Probabilistic view of voting, paradoxes, and manipulation (Q5081545) (← links)
- Taxonomy of powerful voters and manipulation in the framework of social choice functions (Q6051889) (← links)
- A phase transition in Arrow's theorem with three alternatives (Q6616874) (← links)
