Allocation Mechanisms Without Reduction
David Dillenberger () and
Uzi Segal
Additional contact information
David Dillenberger: University of Pennsylvania
PIER Working Paper Archive from Penn Institute for Economic Research, Department of Economics, University of Pennsylvania
Abstract:
We study a simple variant of the house allocation problem (one-sided matching). We demonstrate that agents with recursive preferences may systematically prefer one allocation mechanism to the other, even among mechanisms that are considered to be the same in standard models, in the sense that they induce the same probability distribution over successful matchings. Using this, we propose a new Priority Groups mechanism and provide conditions under which it is preferred to two popular mechanisms, Random Top Cycle and Random Serial Dictatorship.
Keywords: House allocation problem; Non-expected utility; Ran-dom Top Cycle; Random Serial Dictatorship; Reduction of compound lotteries (search for similar items in EconPapers)
JEL-codes: C78 D81 (search for similar items in EconPapers)
Pages: 22 pages
Date: 2021-02-12
References: Add references at CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
https://economics.sas.upenn.edu/sites/default/files/filevault/21-006.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found
Related works:
Journal Article: Allocation Mechanisms without Reduction (2021) 
Working Paper: Allocation Mechanisms Without Reduction (2021) 
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: https://EconPapers.repec.org/RePEc:pen:papers:21-006
Access Statistics for this paper
More papers in PIER Working Paper Archive from Penn Institute for Economic Research, Department of Economics, University of Pennsylvania 133 South 36th Street, Philadelphia, PA 19104. Contact information at EDIRC.
Bibliographic data for series maintained by Administrator ().