Multi-unit assignment under dichotomous preferences
From MaRDI portal
Publication:2173167
DOI10.1016/j.mathsocsci.2019.11.003zbMath1437.91235arXiv1703.10897OpenAlexW2989296767WikidataQ126795136 ScholiaQ126795136MaRDI QIDQ2173167
Publication date: 22 April 2020
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.10897
Lorenz dominancedichotomous preferencescompetitive equilibrium with equal incomesmulti-unit assignment
Related Items (2)
Approximating Nash social welfare under binary XOS and binary subadditive valuations ⋮ Task preference-based bottleneck assignment problem
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic assignment problem with multi-unit demands: a generalization of the serial rule and its characterization
- Kidney exchange: an egalitarian mechanism
- Pairwise kidney exchange
- A solution to the random assignment problem on the full preference domain
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Random assignment of multiple indivisible objects
- Distributive justice in taxation
- Scheduling without payments
- Dividing bads under additive utilities
- Collective choice under dichotomous preferences
- A Concept of Egalitarianism Under Participation Constraints
- Competitive Division of a Mixed Manna
- Priority Rules and Other Asymmetric Rationing Methods
- Random Matching Under Dichotomous Preferences
- A new solution to the random assignment problem.
This page was built for publication: Multi-unit assignment under dichotomous preferences