IDEAS home Printed from https://ideas.repec.org/p/cwl/cwldpp/2000.html
   My bibliography  Save this paper

Optimal Design for Social Learning

Author

Listed:

Abstract

This paper studies the design of a recommender system for organizing social learning on a product. To improve incentives for early experimentation, the optimal design trades off fully transparent social learning by over-recommending a product (or "spamming") to a fraction of agents in the early phase of the product cycle. Under the optimal scheme, the designer spams very little about a product right after its release but gradually increases the frequency of spamming and stops it altogether when the product is deemed sufficiently unworthy of recommendation. The optimal recommender system involves randomly triggered spamming when recommendations are public -- as is often the case for product ratings -- and an information "blackout" followed by a burst of spamming when agents can choose when to check in for a recommendation. Fully transparent recommendations may become optimal if a (socially-benevolent) designer does not observe the agents� costs of experimentation.

Suggested Citation

  • Yeon-Koo Che & Johannes Horner, 2015. "Optimal Design for Social Learning," Cowles Foundation Discussion Papers 2000, Cowles Foundation for Research in Economics, Yale University.
  • Handle: RePEc:cwl:cwldpp:2000
    as

    Download full text from publisher

    File URL: https://cowles.yale.edu/sites/default/files/files/pub/d20/d2000.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Simon, Leo K & Stinchcombe, Maxwell B, 1989. "Extensive Form Games in Continuous Time: Pure Strategies," Econometrica, Econometric Society, vol. 57(5), pages 1171-1214, September.
    2. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    2. Dosis, Anastasios & Muthoo, Abhinay, 2019. "Experimentation in Dynamic R&D Competition," CRETA Online Discussion Paper Series 52, Centre for Research in Economic Theory and its Applications CRETA.
    3. Daron Acemoglu & Ali Makhdoumi & Azarakhsh Malekian & Asuman Ozdaglar, 2017. "Fast and Slow Learning From Reviews," NBER Working Papers 24046, National Bureau of Economic Research, Inc.
    4. Renault, Jérôme & Solan, Eilon & Vieille, Nicolas, 2017. "Optimal dynamic information provision," Games and Economic Behavior, Elsevier, vol. 104(C), pages 329-349.
    5. Nikhil Garg & Ramesh Johari, 2021. "Designing Informative Rating Systems: Evidence from an Online Labor Market," Manufacturing & Service Operations Management, INFORMS, vol. 23(3), pages 589-605, May.
    6. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, 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.
    1. Hu, Audrey & Matthews, Steven A. & Zou, Liang, 2018. "English auctions with ensuing risks and heterogeneous bidders," Journal of Mathematical Economics, Elsevier, vol. 76(C), pages 33-44.
    2. Andrea Attar & Thomas Mariotti & François Salanié, 2021. "Entry-Proofness and Discriminatory Pricing under Adverse Selection," American Economic Review, American Economic Association, vol. 111(8), pages 2623-2659, August.
    3. Kagel, John H. & Levin, Dan, 2009. "Implementing efficient multi-object auction institutions: An experimental study of the performance of boundedly rational agents," Games and Economic Behavior, Elsevier, vol. 66(1), pages 221-237, May.
    4. Hakan İnal, 2017. "An Extension of Ausubel's Auction for Heterogeneous Discrete Goods," Metroeconomica, Wiley Blackwell, vol. 68(4), pages 660-698, November.
    5. Le, Phuong, 2018. "Pareto optimal budgeted combinatorial auctions," Theoretical Economics, Econometric Society, vol. 13(2), May.
    6. Shrestha, Ratna K., 2017. "Menus of price-quantity contracts for inducing the truth in environmental regulation," Journal of Environmental Economics and Management, Elsevier, vol. 83(C), pages 1-7.
    7. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    8. Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    9. Dan Levin, 2005. "Demand Reduction in Multi-Unit Auctions: Evidence from a Sportscard Field Experiment: Comment," American Economic Review, American Economic Association, vol. 95(1), pages 467-471, March.
    10. Johannes Hörner & Larry Samuelson, 2013. "Incentives for experimenting agents," RAND Journal of Economics, RAND Corporation, vol. 44(4), pages 632-663, December.
    11. de Groot Ruiz, Adrian & Ramer, Roald & Schram, Arthur, 2016. "Formal versus informal legislative bargaining," Games and Economic Behavior, Elsevier, vol. 96(C), pages 1-17.
    12. Ayman Chouayakh & Aurélien Bechler & Isabel Amigo & Loutfi Nuaymi & Patrick Maillé, 2021. "A truthful ascending auction mechanism for dynamic allocation of LSA spectrum blocks," Netnomics, Springer, vol. 22(1), pages 27-52, June.
    13. Robert Kleinberg & Bo Waggoner & E. Glen Weyl, 2016. "Descending Price Optimally Coordinates Search," Papers 1603.07682, arXiv.org, revised Dec 2016.
    14. Brunnermeier, Markus K. & Morgan, John, 2010. "Clock games: Theory and experiments," Games and Economic Behavior, Elsevier, vol. 68(2), pages 532-550, March.
    15. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    16. Berninghaus, Siegfried K. & Ehrhart, Karl-Martin & Ott, Marion, 2008. "Myopically Forward-Looking Agents in a Network Formation Game: Theory and Experimental Evidence," Sonderforschungsbereich 504 Publications 08-02, Sonderforschungsbereich 504, Universität Mannheim;Sonderforschungsbereich 504, University of Mannheim.
    17. Pär Holmberg, 2017. "Pro‐competitive Rationing in Multi‐unit Auctions," Economic Journal, Royal Economic Society, vol. 127(605), pages 372-395, October.
    18. Ranaldo, Angelo & Rossi, Enzo, 2016. "Uniform-price Auctions for Swiss Government Bonds: Origin and Evolution," Working Papers on Finance 1609, University of St. Gallen, School of Finance.
    19. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    20. Pastine, Tuvana & Pastine, Ivan, 2001. "Cost of Delay, Deadlines and Endogenous Price Leadership," CEPR Discussion Papers 3054, C.E.P.R. Discussion Papers.

    More about this item

    Keywords

    Experimentation; Social learning; Mechanism design;
    All these keywords.

    JEL classification:

    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness
    • M52 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Personnel Economics - - - Compensation and Compensation Methods and Their Effects

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cwl:cwldpp:2000. 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: Brittany Ladd (email available below). General contact details of provider: https://edirc.repec.org/data/cowleus.html .

    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.