Economics at your fingertips  

Fair solutions to the random assignment problem

Christian Basteck ()

Journal of Mathematical Economics, 2018, vol. 79, issue C, 163-172

Abstract: We study the problem of assigning indivisible goods to individuals where each is to receive one good. To guarantee fairness in the absence of monetary compensation, we consider random assignments that individuals evaluate according to first order stochastic dominance (sd). In particular, we find that solutions which guarantee sd-no-envy (e.g. the Probabilistic Serial) are incompatible even with the weak sd-core from equal division. Solutions on the other hand that produce assignments in the strong sd-core from equal division (e.g. Hylland and Zeckhauser’s Walrasian Equilibria from Equal Incomes) are incompatible with the strong sd-equal-division-lower-bound. As an alternative, we present a solution, based on Walrasian equilibria, that is sd-efficient, in the weak sd-core from equal division, and satisfies the strong sd-equal-division-lower-bound.

Keywords: Probabilistic serial; Walrasian equilibrium; Sd-efficiency; Sd-envy-freeness; Sd-core from equal division; Sd-equal-division-lower-bound (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Fair solutions to the random assignment problem (2016) Downloads
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Dana Niculescu ().

Page updated 2019-03-31
Handle: RePEc:eee:mateco:v:79:y:2018:i:c:p:163-172