Pages that link to "Item:Q1697833"
From MaRDI portal
The following pages link to Impossibilities for probabilistic assignment (Q1697833):
Displaying 6 items.
- Fair solutions to the random assignment problem (Q1633672) (← links)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- Group strategy-proof probabilistic voting with single-peaked preferences (Q2092786) (← links)
- When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
- Multi resource allocation with partial preferences (Q2680798) (← links)
- On existence of truthful fair cake cutting mechanisms (Q6161496) (← links)