Efficient sequential assignment with incomplete information
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Games and Economic Behavior.
Volume (Year): 68 (2010)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622836
Dynamic mechanism design Sequential assignment;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- S. Christian Albright, 1974. "Optimal Sequential Assignments with Random Arrival Times," Management Science, INFORMS, vol. 21(1), pages 60-67, September.
- Yokoo, Makoto & Sakurai, Yuko & Matsubara, Shigeo, 2004. "The effect of false-name bids in combinatorial auctions: new fraud in internet auctions," Games and Economic Behavior, Elsevier, vol. 46(1), pages 174-188, January.
- Dirk Bergemann & Juuso Välimäki, 2006.
"Efficient Dynamic Auctions,"
321307000000000580, UCLA Department of Economics.
- Susan Athey & Ilya Segal, 2007. "An Efficient Dynamic Mechanism," Levine's Bibliography 122247000000001134, UCLA Department of Economics.
- Moulin, Hervé, 2009. "Almost budget-balanced VCG mechanisms to assign multiple objects," Journal of Economic Theory, Elsevier, vol. 144(1), pages 96-119, January.
- Guo, Mingyu & Conitzer, Vincent, 2009. "Worst-case optimal redistribution of VCG payments in multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 67(1), pages 69-98, September.
- Dirk Bergemann & Maher Said, 2010.
"Dynamic Auctions: A Survey,"
Cowles Foundation Discussion Papers
1757, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
- Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Cowles Foundation Discussion Papers 1757R, Cowles Foundation for Research in Economics, Yale University, revised May 2010.
- Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000111, David K. Levine.
- Francis Bloch & Nicolas Houy, 2009.
"Optimal Assignment of Durable Objects to Successive Agents,"
- Francis Bloch & Nicolas Houy, 2012. "Optimal assignment of durable objects to successive agents," Economic Theory, Springer, vol. 51(1), pages 13-33, September.
- Said, Maher, 2012.
"Auctions with dynamic populations: Efficiency and revenue maximization,"
Journal of Economic Theory,
Elsevier, vol. 147(6), pages 2419-2438.
- Said, Maher, 2008. "Auctions with Dynamic Populations: Efficiency and Revenue Maximization," MPRA Paper 11456, University Library of Munich, Germany.
- Gershkov, Alex & Moldovanu, Benny, 2012. "Dynamic allocation and pricing: A mechanism design approach," International Journal of Industrial Organization, Elsevier, vol. 30(3), pages 283-286.
- Anna Krasnosielska-Kobos & Elżbieta Ferenstein, 2013. "Construction of Nash Equilibrium in a Game Version of Elfving’s Multiple Stopping Problem," Dynamic Games and Applications, Springer, vol. 3(2), pages 220-235, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.