Pages that link to "Item:Q2500716"
From MaRDI portal
The following pages link to Abstention as an escape from arrow's theorem (Q2500716):
Displaying 8 items.
- The number of times an anonymous rule violates independence in the \(3 \times 3\) case (Q535396) (← links)
- Is abstention an escape from Arrow's theorem? (Q535402) (← links)
- Majority decisions when abstention is possible (Q764902) (← links)
- Impossibility theorems are modified and unified (Q904838) (← links)
- Aggregation of binary evaluations with abstentions (Q969118) (← links)
- Nash implementation via mechanisms that allow for abstentions (Q2046171) (← links)
- Existence of approximate social welfare (Q2467527) (← links)
- Anonymous, non-manipulable binary social choice (Q2673213) (← links)