Research Article
Matching with Stochastic Arrival
@ARTICLE{10.4108/eai.8-8-2015.2260625, author={Neil Thakral}, title={Matching with Stochastic Arrival}, journal={EAI Endorsed Transactions on Collaborative Computing}, volume={2}, number={10}, publisher={ACM}, journal_a={CC}, year={2015}, month={8}, keywords={market design, dynamic matching, public housing allocation}, doi={10.4108/eai.8-8-2015.2260625} }- Neil Thakral
Year: 2015
Matching with Stochastic Arrival
CC
EAI
DOI: 10.4108/eai.8-8-2015.2260625
Abstract
We study matching in a dynamic setting, with applications to the allocation of public housing. In our model, objects of different types that arrive stochastically over time must be allocated to agents in a queue. For the case that the objects share a common priority ordering over agents, we introduce a strategy-proof mechanism that satisfies certain fairness and efficiency properties. More generally, we show that the mechanism continues to satisfy these properties if and only if the priority relations satisfy an acyclicity condition. We then turn to an application of the framework by evaluating the procedures that are currently being used to allocate public housing. The estimated welfare gains from adopting the new mechanism are substantial, exceeding $5,000 per applicant.
Copyright © 2015 N. Thakral, licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.
