Prior-free dynamic allocation under limited liability
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Dirk Bergemann & Juuso Välimäki, 2006.
"Efficient Dynamic Auctions,"
Levine's Bibliography
321307000000000580, UCLA Department of Economics.
- Dirk Bergemann & Juuso Valimaki, 2006. "Efficient Dynamic Auctions," Cowles Foundation Discussion Papers 1584, Cowles Foundation for Research in Economics, Yale University.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Francis Bloch & David Cantala, 2013.
"Markovian assignment rules,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(1), pages 1-25, January.
- Francis Bloch & David Cantala, 2008. "Markovian assignment rules," Working Papers hal-00356304, HAL.
- Francis Bloch & David Cantala, 2013. "Markovian assignment rules," PSE-Ecole d'économie de Paris (Postprint) hal-01013737, HAL.
- Francis Bloch & David Cantala, 2013. "Markovian assignment rules," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01013737, HAL.
- Francis Bloch & David Cantala, 2013. "Markovian assignment rules," Post-Print hal-01013737, HAL.
- Francis Bloch & David Cantala, 2010. "Markovian assignment rules," Serie documentos de trabajo del Centro de Estudios Económicos 2010-18, El Colegio de México, Centro de Estudios Económicos.
- moldovanu, benny & Gershkov, Alex, 2007.
"The Dynamic Assignment of Heterogenous Objects: A Mechanism Design Approach,"
CEPR Discussion Papers
6439, C.E.P.R. Discussion Papers.
- Alex Gershkov & Benny Moldovanu, 2007. "Dynamic Assignment of Heterogeneous Objects: A Mechanism Design Approach," Levine's Working Paper Archive 843644000000000381, David K. Levine.
- Hamid Nazerzadeh & Amin Saberi & Rakesh Vohra, 2007. "Dynamic Cost-Per-Action Mechanisms and Applications to Online Advertising," Discussion Papers 1450, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Bharadwaj Satchidanandan & Munther A. Dahleh, 2022. "Incentive Compatibility in Two-Stage Repeated Stochastic Games," Papers 2203.10206, arXiv.org, revised Oct 2022.
- Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
More about this item
Keywords
Dynamic allocation; renegotiation-proofness; lending; limited liability; VCG; approachability; online optimization; cautiousness; forgiveness;All these keywords.
JEL classification:
- D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:the:publsh:4575. See general information about how to correct material in RePEc.
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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Martin J. Osborne (email available below). General contact details of provider: http://econtheory.org .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.