Pages that link to "Item:Q656886"
From MaRDI portal
The following pages link to A characterization of the maximin rule in the context of voting (Q656886):
Displaying 10 items.
- Computational complexity of manipulation: a survey (Q334204) (← links)
- On the subgame perfect implementability of voting rules (Q2244426) (← links)
- Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
- Confidence in preferences (Q2450076) (← links)
- Duplication in OWA-Generated Positional Aggregation Rules (Q2864242) (← links)
- The Last Voting Rule Is Home: Complexity of Control by Partition of Candidates or Voters in Maximin Elections (Q4999224) (← links)
- Two characterizations of the dense rank (Q6121904) (← links)
- Compromising as an equal loss principle (Q6172228) (← links)
- Note on compromise axiom (Q6589397) (← links)
- False-name-proof and strategy-proof voting rules under separable preferences (Q6611995) (← links)
