IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v118y2013i1p121-125.html
   My bibliography  Save this article

Non-Bayesian optimal search and dynamic implementation

Author

Listed:
  • Gershkov, Alex
  • Moldovanu, Benny

Abstract

We 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.

Suggested Citation

  • Gershkov, Alex & Moldovanu, Benny, 2013. "Non-Bayesian optimal search and dynamic implementation," Economics Letters, Elsevier, vol. 118(1), pages 121-125.
  • Handle: RePEc:eee:ecolet:v:118:y:2013:i:1:p:121-125
    DOI: 10.1016/j.econlet.2012.09.026
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176512005332
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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..
    2. Jehiel, Philippe & Moldovanu, Benny, 2001. "Efficient Design with Interdependent Valuations," Econometrica, Econometric Society, vol. 69(5), pages 1237-1259, September.
    3. Epstein, Larry G. & Noor, Jawwad & Sandroni, Alvaro, 2008. "Non-Bayesian updating: A theoretical framework," Theoretical Economics, Econometric Society, vol. 3(2), June.
    4. Chou, Chien-fu & Talmain, Gabriel, 1993. "Nonparametric search," Journal of Economic Dynamics and Control, Elsevier, vol. 17(5-6), pages 771-784.
    5. Cyrus Derman & Gerald J. Lieberman & Sheldon M. Ross, 1972. "A Sequential Stochastic Assignment Problem," Management Science, INFORMS, vol. 18(7), pages 349-355, March.
    6. Bikhchandani, Sushil & Sharma, Sunil, 1996. "Optimal search with learning," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 333-359.
    7. Partha Dasgupta & Eric Maskin, 2000. "Efficient Auctions," The Quarterly Journal of Economics, Oxford University Press, vol. 115(2), pages 341-388.
    8. S. Christian Albright, 1977. "A Bayesian Approach to a Generalized House Selling Problem," Management Science, INFORMS, vol. 24(4), pages 432-440, December.
    9. 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.
    10. Alex Gershkov & Benny Moldovanu, 2009. "Learning about the Future and Dynamic Efficiency," American Economic Review, American Economic Association, vol. 99(4), pages 1576-1587, September.
    11. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Dynamic mechanism design; Optimal stopping; Learning;

    JEL classification:

    • D4 - Microeconomics - - Market Structure, Pricing, and Design
    • D8 - Microeconomics - - Information, Knowledge, and Uncertainty

    Statistics

    Access and download statistics

    Corrections

    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:eee:ecolet:v:118:y:2013:i:1:p:121-125. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/ecolet .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.