Matching with Stochastic Arrival
Journal Title: EAI Endorsed Transactions on Collaborative Computing - Year 2016, Vol 2, Issue 10
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.
Authors and Affiliations
Neil Thakral
Keywords
Related Articles
- EP ID EP45727
- DOI http://dx.doi.org/10.4108/eai.8-8-2015.2260625
- Views 328
- Downloads 0
PVSio-web: mathematically based tool support for the design of interactive and interoperable medical systems
Use errors, where medical devices work to specification but lead to the clinicians making mistakes resulting in patient harm, is a critical problem. Manufacturers need tools to help them find such design flaws at an earl...
Lighting controls and energy savings potential in tropical zone
Reducing global energy consumption is a challenge to limit the rise in average earth temperature. The use of lighting controls in the building leads to energy savings. The objective of this study is to evaluate the energ...
Message from the Editors-in-Chief
We are very pleased to welcome you all to the second issue of this journal. In this issue, we present six selected invited papers that span various aspects of collaborative computing and technologies. In particular, t...
Guest Editorial: Selected Papers from IEEE IEEE/EAI CollaborateCom 2013
This issue of EAI Transactions on Collaborative Computing includes extended versions of articles selected from the program of the 9th IEEE International Conference on Collaborative Computing: Networking, Applications...
Critically loaded k-limited polling systems
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is t...