Non-Bayesian optimal search and dynamic implementation
AbstractWe show that a non-Bayesian learning procedure leads to very permissive implementation results concerning the efficient allocation of resources in a dynamic environment where impatient, privately informed agents arrive over time, and where the designer gradually learns about the distribution of agents’ values. This contrasts the rather restrictive results that have been obtained for Bayesian learning in the same environment, and highlights the role of the learning procedure in dynamic mechanism design problems.
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 Economics Letters.
Volume (Year): 118 (2013)
Issue (Month): 1 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/ecolet
Dynamic mechanism design; Optimal stopping; Learning;
Find related papers by JEL classification:
- D4 - Microeconomics - - Market Structure and Pricing
- D8 - Microeconomics - - Information, Knowledge, and Uncertainty
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.:
- Epstein, Larry G. & Noor, Jawwad & Sandroni, Alvaro, 2008.
"Non-Bayesian updating: A theoretical framework,"
Econometric Society, vol. 3(2), June.
- Larry Epstein & Jawwad Noor & Alvaro Sandroni, 2005. "Non-Bayesian Updating: a Theoretical Framework," RCER Working Papers 518, University of Rochester - Center for Economic Research (RCER).
- Larry G. Epstein & Jawwad Noor & Alvaro Sandroni, 2005. "Non-Bayesian Updating: A Theoretical Framework," Boston University - Department of Economics - Working Papers Series WP2005-025, Boston University - Department of Economics.
- Larry G. Epstein & Jawwad Noor & Alvaro Sandroni, 2005. "Non-Bayesian Updating: A Theoretical Framework," Boston University - Department of Economics - Working Papers Series WP2005-049, Boston University - Department of Economics.
- Larry G. Epstein & Alvaro Sandroni, 2003. "Non-Bayesian Updating : A Theoretical Framework," RCER Working Papers 505, University of Rochester - Center for Economic Research (RCER).
- Rothschild, Michael, 1974. "Searching for the Lowest Price When the Distribution of Prices Is Unknown," Journal of Political Economy, University of Chicago Press, vol. 82(4), pages 689-711, July/Aug..
- Partha Dasgupta & Eric Maskin, 2000.
The Quarterly Journal of Economics,
MIT Press, vol. 115(2), pages 341-388, May.
- P. Dasgupta & Eric Maskin, 1998. "Efficient Auctions," Harvard Institute of Economic Research Working Papers 1857, Harvard - Institute of Economic Research.
- Jehiel, Phillipe & Moldovanu, Benny, 1999.
"Efficient Design with Interdependent Valuations,"
Sonderforschungsbereich 504 Publications
99-74, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim.
- Philippe Jehiel & Benny Moldovanu, 1998. "Efficient Design with Interdependent Valuations," Discussion Papers 1244, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jehiel, Phillipe & Moldovanu, Benny, 1998. "Efficient Design with Interdependent Valuations," Sonderforschungsbereich 504 Publications 98-22, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim.
- Gabriel Talmain & Chien-Fu Chou, 1990. "Non-Parametric Search," Discussion Papers 92-01, University at Albany, SUNY, Department of Economics.
- Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
- Alex Gershkov & Benny Moldovanu, 2010.
"Optimal Search, Learning and Implementation,"
Discussion Paper Series
dp543, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Bikhchandani, Sushil & Sharma, Sunil, 1996.
"Optimal search with learning,"
Journal of Economic Dynamics and Control,
Elsevier, vol. 20(1-3), pages 333-359.
- S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
- Alex Gershkov & Benny Moldovanu, 2009. "Learning about the Future and Dynamic Efficiency," American Economic Review, American Economic Association, vol. 99(4), pages 1576-87, September.
- Chou, Chien-fu & Talmain, Gabriel, 1993. "Nonparametric search," Journal of Economic Dynamics and Control, Elsevier, vol. 17(5-6), pages 771-784.
- Michael Rothschild, 1974. "Searching for the Lowest Price When the Distribution of Prices Is Unknown: A Summary," NBER Chapters, in: Annals of Economic and Social Measurement, Volume 3, number 1, pages 293-294 National Bureau of Economic Research, Inc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
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.