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
    File URL: https://libkey.io/10.1016/j.econlet.2012.09.026?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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.
    1. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
    2. Benny Moldovanu & Alex Gershkov, 2008. "The Trade-off Between Fast Learning and Dynamic Efficiency," 2008 Meeting Papers 348, Society for Economic Dynamics.
    3. Yen‐Ming Lee & Sheldon M. Ross, 2013. "Bayesian selling problem with partial information," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(7), pages 557-570, October.
    4. Adam, Klaus, 2001. "Learning While Searching for the Best Alternative," Journal of Economic Theory, Elsevier, vol. 101(1), pages 252-280, November.
    5. Gerald Häubl & Benedict G. C. Dellaert & Bas Donkers, 2010. "Tunnel Vision: Local Behavioral Influences on Consumer Decisions in Product Search," Marketing Science, INFORMS, vol. 29(3), pages 438-455, 05-06.
    6. Babur De los Santos & Ali Hortacsu & Matthijs R. Wildenbeest, 2012. "Search with Learning," Working Papers 2012-03, Indiana University, Kelley School of Business, Department of Business Economics and Public Policy.
    7. Amelie F. Constant & Annabelle Krause & Ulf Rinne & Klaus F. Zimmermann, 2017. "Reservation wages of first- and second-generation migrants," Applied Economics Letters, Taylor & Francis Journals, vol. 24(13), pages 945-949, July.
    8. Yizhaq Minchuk & Aner Sela, 2018. "Asymmetric sequential search under incomplete information," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 27(2), pages 315-325, June.
    9. Andreas I. Mueller & Johannes Spinnewijn & Giorgio Topa, 2021. "Job Seekers' Perceptions and Employment Prospects: Heterogeneity, Duration Dependence, and Bias," American Economic Review, American Economic Association, vol. 111(1), pages 324-363, January.
    10. Akiko Maruyama, 2018. "One-sided learning about one fs own type in a two-sided search model: The case of n types of agents," GRIPS Discussion Papers 18-15, National Graduate Institute for Policy Studies.
    11. Ryvkin, Dmitry & Serra, Danila, 2020. "Corruption and competition among bureaucrats: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 175(C), pages 439-451.
    12. Babur De Los Santos & Ali Hortacsu & Matthijs R. Wildenbeest, 2012. "Testing Models of Consumer Search Using Data on Web Browsing and Purchasing Behavior," American Economic Review, American Economic Association, vol. 102(6), pages 2955-2980, October.
    13. Akiko Maruyama, 2016. "One-sided learning about one's own type in a two-sided search model," GRIPS Discussion Papers 15-26, National Graduate Institute for Policy Studies.
    14. Dubra, J., 1999. "Overconfidence in Search," Working Papers 99-10, C.V. Starr Center for Applied Economics, New York University.
    15. Thomas J. Emmerling & Abdullah Yavas & Yildiray Yildirim, 2021. "To accept or not to accept: Optimal strategy for sellers in real estate," Real Estate Economics, American Real Estate and Urban Economics Association, vol. 49(S1), pages 268-296, March.
    16. Tapan Biswas & Jolian Mchardy, 2012. "Asking Price And Price Discounts: The Strategy Of Selling An Asset Under Price Uncertainty," Review of Economic Analysis, Digital Initiatives at the University of Waterloo Library, vol. 4(1), pages 17-37, June.
    17. Bikhchandani, Sushil & Sharma, Sunil, 1996. "Optimal search with learning," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 333-359.
    18. Rafael P. Greminger, 2019. "Optimal Search and Discovery," Papers 1911.07773, arXiv.org, revised Feb 2022.
    19. Larson, C. Erik & Olson, Lars J. & Sharma, Sunil, 2001. "Optimal Inventory Policies when the Demand Distribution Is Not Known," Journal of Economic Theory, Elsevier, vol. 101(1), pages 281-300, November.
    20. 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.

    More about this item

    Keywords

    Dynamic mechanism design; Optimal stopping; Learning;
    All these keywords.

    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.

    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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ecolet .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.