The following pages link to In Silico Voting Experiments (Q2829686):
Displaying 5 items.
- Strategic manipulability of self-selective social choice rules (Q492810) (← links)
- Two-player fair division of indivisible items: comparison of algorithms (Q724147) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Robust bounds on choosing from large tournaments (Q5970863) (← links)
- Characterizing the top cycle via strategyproofness (Q6076911) (← links)
