Ex-post favoring ranks: a fairness notion for the random assignment problem
From MaRDI portal
Publication:2059097
Recommendations
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
- A new solution to the random assignment problem.
- Fair solutions to the random assignment problem
- Fairness and group-strategyproofness clash in assignment problems
- The object allocation problem with random priorities
Cites work
- A new solution to the random assignment problem.
- Fair solutions to the random assignment problem
- Fairness and efficiency in strategy-proof object allocation mechanisms
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- Individual sense of fairness: an experimental study
- New axioms for immediate acceptance
- Object allocation via immediate-acceptance: characterizations and an affirmative action application
- On a conjecture by Gale about one-sided matching problems
- Partial strategyproofness: relaxing strategyproofness for the random assignment problem
- The ``Boston school-choice mechanism: an axiomatic approach
- The modified Boston mechanism
Cited in
(9)- Towards a fair distribution mechanism for asylum
- Robust ex-post Pareto efficiency and fairness in random assignments: two impossibility results
- Randomized assignments for barter exchanges: fairness vs. efficiency
- Ranking with Fairness Constraints
- Favoring Eagerness for Remaining Items: Designing Efficient, Fair, and Strategyproof Mechanisms
- The object allocation problem with favoring upper ranks
- The fractional Boston random assignment rule and its axiomatic characterization
- Characterizing a probabilistic version of the Boston mechanism under weak priorities
- Egalitarian random assignment
This page was built for publication: Ex-post favoring ranks: a fairness notion for the random assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2059097)