Egalitarian random assignment
From MaRDI portal
Cites work
- A new solution to the random assignment problem.
- A simple random assignment problem with a unique solution
- A solution to the random assignment problem on the full preference domain
- Efficient rules for probabilistic assignment
- Ex-post favoring ranks: a fairness notion for the random assignment problem
- Fair solutions to the random assignment problem
- Fairness and efficiency in strategy-proof object allocation mechanisms
- Network flows. Theory, algorithms, and applications.
- Object allocation via immediate-acceptance: characterizations and an affirmative action application
- On wastefulness of random assignments in discrete allocation problems
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- Random assignment: redefining the serial rule
- Random Matching Under Dichotomous Preferences
- Stepwise ordinal efficiency for the random assignment problem
- The ``Boston school-choice mechanism: an axiomatic approach
- The Borda class. An axiomatic study of the Borda rule on top-truncated preferences
- The Borda count with weak preferences
- The fractional Boston random assignment rule and its axiomatic characterization
- The Sharing Problem
- Why do popular mechanisms lack efficiency in random environments?
This page was built for publication: Egalitarian random assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6938967)
