Efficient sequential assignment with incomplete information
Alex Gershkov and
Benny Moldovanu ()
Games and Economic Behavior, 2010, vol. 68, issue 1, 144-154
We study the welfare maximizing assignment of several heterogeneous, commonly ranked objects to impatient agents with privately known characteristics who arrive sequentially according to a Poisson or renewal process. There is a deadline after which no more objects can be allocated. We first show that the dynamically efficient allocation, characterized by Albright [Albright, S.C., 1974. Optimal sequential assignments with random arrival times. Manage. Sci. 21 (1), 60-67], is implementable by the dynamic version of VCG mechanism. We then obtain several properties of the welfare maximizing policy using stochastic dominance measures of increased variability and majorization arguments. We also propose redistribution mechanisms that 1) implement the efficient allocation, 2) satisfy individual rationality, 3) never run a budget deficit, 4) may run a budget surplus that vanishes asymptotically.
Keywords: Dynamic; mechanism; design; Sequential; assignment (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (16) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:68:y:2010:i:1:p:144-154
Access Statistics for this article
Games and Economic Behavior is currently edited by E. Kalai
More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Haili He ().