House Allocation with Overlapping Agents: A Dynamic Mechanism Design Approach
Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the beginning and then becomes an "existing tenant". Motivated by this observation, we introduce a model of house allocation with overlapping agents. In terms of dynamic mechanism design, we examine two representative static mechanisms of serial dictatorship (SD) and top trading cycles (TTC), both of which are based on an ordering of agents and give an agent with higher order an opportunity to obtain a better house. We show that for SD mechanisms, the ordering that favors existing tenants is better than the one that favors newcomers in terms of Pareto efficiency. Meanwhile, this result holds for TTC mechanisms under time-invariant preferences in terms of Pareto efficiency and strategy-proofness. We provide another simple dynamic mechanism that is strategy-proof and Pareto efficient.
|Date of creation:||25 Sep 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Carl-Zeiss-Strasse 3, 07743 JENA|
Phone: +049 3641/ 9 43000
Fax: +049 3641/ 9 43000
Web page: http://www.jenecon.de
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:jrp:jrpwrp:2009-075. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Markus Pasche)
If references are entirely missing, you can add them using this form.