Pages that link to "Item:Q2359384"
From MaRDI portal
The following pages link to Fairness and efficiency in strategy-proof object allocation mechanisms (Q2359384):
Displaying 21 items.
- Fair solutions to the random assignment problem (Q1633672) (← links)
- On the tradeoff between efficiency and strategyproofness (Q1651219) (← links)
- Efficient and fair assignment mechanisms are strongly group manipulable (Q1729671) (← links)
- Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences (Q1786741) (← links)
- Upper-contour strategy-proofness in the probabilistic assignment problem (Q1986600) (← links)
- Stepwise ordinal efficiency for the random assignment problem (Q1996179) (← links)
- Ex-post favoring ranks: a fairness notion for the random assignment problem (Q2059097) (← links)
- A pessimist's approach to one-sided matching (Q2103007) (← links)
- Minimal envy and popular matchings (Q2242327) (← links)
- The impossibility of strategy-proof, Pareto efficient, and individually rational rules for fractional matching (Q2291153) (← links)
- When are efficient and fair assignment mechanisms group strategy-proof? (Q2291174) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- Strategyproof social choice when preferences and outcomes may contain ties (Q2673159) (← links)
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results (Q2675456) (← links)
- Strategy-proof allocation with outside option (Q2681500) (← links)
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms (Q5881800) (← links)
- Strategy-proof and envy-free mechanisms for house allocation (Q6090447) (← links)
- Random assignments with uniform preferences: an impossibility result (Q6106541) (← links)
- On wastefulness of random assignments in discrete allocation problems (Q6113818) (← links)
- Strategy-proof and envy-free random assignment (Q6163283) (← links)
- A new impossibility result for random assignments (Q6170029) (← links)