IDEAS home Printed from https://ideas.repec.org/p/ecl/stabus/3865.html
   My bibliography  Save this paper

On the Disclosure of Promotion Value in Platforms with Learning Sellers

Author

Listed:
  • Gur, Yonatan

    (Stanford U)

  • Macnamara, Gregory

    (Stanford U)

  • Saban, Daniela

    (Stanford U)

Abstract

In many marketplaces that facilitate trade with the objective of maximizing consumer surplus, prices are set by revenue-maximizing sellers but platforms can influence prices through (i) price-dependent promotion policies that can increase demand for a product by featuring it in a prominent position in the webpage and (ii) the information revealed to sellers about the value of being promoted. Identifying effective joint information design and promotion policies is a challenging dynamic problem as sellers can sequentially learn the promotion value from sales observations and update prices accordingly. We introduce the notion of confounding promotion policies, which are designed to prevent a Bayesian seller from learning the promotion value (at the expense of the short-run loss of diverting consumers from the best product offering). Leveraging these policies, we characterize the maximum long-run average consumer surplus that is achievable through joint information design and promotion policies when the seller sets prices myopically. We then establish a Bayesian Nash equilibrium by showing that the seller's best response to the platform's optimal policy is to price myopically at every history. The equilibrium we identify is platform-optimal within the class of horizon-maximin equilibria, in which strategies are not predicated on precise knowledge of the horizon length, and are designed to maximize payoff over the worst-case horizon. Our analysis allows one to identify effective platform policies in a broad range of demand models.

Suggested Citation

  • Gur, Yonatan & Macnamara, Gregory & Saban, Daniela, 2020. "On the Disclosure of Promotion Value in Platforms with Learning Sellers," Research Papers 3865, Stanford University, Graduate School of Business.
  • Handle: RePEc:ecl:stabus:3865
    as

    Download full text from publisher

    File URL: https://ygur.people.stanford.edu/sites/g/files/sbiybj5191/f/on_the_disclosure_of_promption_value_in_platofrms_with_learning_sellers.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Emir Kamenica & Matthew Gentzkow, 2011. "Bayesian Persuasion," American Economic Review, American Economic Association, vol. 101(6), pages 2590-2615, October.
    2. Vivek F. Farias & Benjamin Van Roy, 2010. "Dynamic Pricing with a Prior on Market Response," Operations Research, INFORMS, vol. 58(1), pages 16-29, February.
    3. Omar Besbes & Alp Muharremoglu, 2013. "On Implications of Demand Censoring in the Newsvendor Problem," Management Science, INFORMS, vol. 59(6), pages 1407-1424, June.
    4. Arnoud V. den Boer & Bert Zwart, 2014. "Simultaneously Learning and Optimizing Using Controlled Variance Pricing," Management Science, INFORMS, vol. 60(3), pages 770-783, March.
    5. Luis Rayo & Ilya Segal, 2010. "Optimal Information Disclosure," Journal of Political Economy, University of Chicago Press, vol. 118(5), pages 949-987.
    6. J. Michael Harrison & N. Bora Keskin & Assaf Zeevi, 2012. "Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution," Management Science, INFORMS, vol. 58(3), pages 570-586, March.
    7. Maxime C. Cohen & Ngai-Hang Zachary Leung & Kiran Panchamgam & Georgia Perakis & Anthony Smith, 2017. "The Impact of Linear Optimization on Promotion Planning," Operations Research, INFORMS, vol. 65(2), pages 446-468, April.
    8. Victor F. Araman & René Caldentey, 2009. "Dynamic Pricing for Nonperishable Products with Demand Learning," Operations Research, INFORMS, vol. 57(5), pages 1169-1188, October.
    9. N. Bora Keskin & Assaf Zeevi, 2014. "Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies," Operations Research, INFORMS, vol. 62(5), pages 1142-1167, October.
    10. Michael Dinerstein & Liran Einav & Jonathan Levin & Neel Sundaresan, 2018. "Consumer Price Search and Platform Design in Internet Commerce," American Economic Review, American Economic Association, vol. 108(7), pages 1820-1859, July.
    11. David Lingenbrink & Krishnamurthy Iyer, 2019. "Optimal Signaling Mechanisms in Unobservable Queues," Operations Research, INFORMS, vol. 67(5), pages 1397-1416, September.
    12. Robert J. Aumann, 1995. "Repeated Games with Incomplete Information," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262011476, April.
    13. Jeffrey Ely & Alexander Frankel & Emir Kamenica, 2015. "Suspense and Surprise," Journal of Political Economy, University of Chicago Press, vol. 123(1), pages 215-260.
    14. Denis Sauré & Assaf Zeevi, 2013. "Optimal Dynamic Assortment Planning with Demand Learning," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 387-404, July.
    15. Felipe Caro & Jérémie Gallien, 2007. "Dynamic Assortment with Demand Learning for Seasonal Consumer Goods," Management Science, INFORMS, vol. 53(2), pages 276-292, February.
    16. Woonghee Tim Huh & Paat Rusmevichientong, 2009. "A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 103-123, February.
    17. Gabriel Carroll, 2015. "Robustness and Linear Contracts," American Economic Review, American Economic Association, vol. 105(2), pages 536-563, February.
    18. Andrei Hagiu & Bruno Jullien, 2011. "Why do intermediaries divert search?," RAND Journal of Economics, RAND Corporation, vol. 42(2), pages 337-362, June.
    19. Omar Besbes & Assaf Zeevi, 2009. "Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms," Operations Research, INFORMS, vol. 57(6), pages 1407-1420, December.
    20. Omar Besbes & Yonatan Gur & Assaf Zeevi, 2016. "Optimization in Online Content Recommendation Services: Beyond Click-Through Rates," Manufacturing & Service Operations Management, INFORMS, vol. 18(1), pages 15-33, February.
    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. Yonatan Gur & Gregory Macnamara & Ilan Morgenstern & Daniela Saban, 2019. "Information Disclosure and Promotion Policy Design for Platforms," Papers 1911.09256, arXiv.org, revised Dec 2022.
    2. den Boer, Arnoud V., 2015. "Tracking the market: Dynamic pricing and learning in a changing environment," European Journal of Operational Research, Elsevier, vol. 247(3), pages 914-927.
    3. Ruben Geer & Arnoud V. Boer & Christopher Bayliss & Christine S. M. Currie & Andria Ellina & Malte Esders & Alwin Haensel & Xiao Lei & Kyle D. S. Maclean & Antonio Martinez-Sykora & Asbjørn Nilsen Ris, 2019. "Dynamic pricing and learning with competition: insights from the dynamic pricing challenge at the 2017 INFORMS RM & pricing conference," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 18(3), pages 185-203, June.
    4. Ruben van de Geer & Arnoud V. den Boer & Christopher Bayliss & Christine Currie & Andria Ellina & Malte Esders & Alwin Haensel & Xiao Lei & Kyle D. S. Maclean & Antonio Martinez-Sykora & Asbj{o}rn Nil, 2018. "Dynamic Pricing and Learning with Competition: Insights from the Dynamic Pricing Challenge at the 2017 INFORMS RM & Pricing Conference," Papers 1804.03219, arXiv.org.
    5. Boxiao Chen & Xiuli Chao & Cong Shi, 2021. "Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 726-756, May.
    6. Huashuai Qu & Ilya O. Ryzhov & Michael C. Fu & Eric Bergerson & Megan Kurka & Ludek Kopacek, 2020. "Learning Demand Curves in B2B Pricing: A New Framework and Case Study," Production and Operations Management, Production and Operations Management Society, vol. 29(5), pages 1287-1306, May.
    7. Arnoud V. den Boer & N. Bora Keskin, 2020. "Discontinuous Demand Functions: Estimation and Pricing," Management Science, INFORMS, vol. 66(10), pages 4516-4534, October.
    8. Sentao Miao & Xi Chen & Xiuli Chao & Jiaxi Liu & Yidong Zhang, 2022. "Context‐based dynamic pricing with online clustering," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3559-3575, September.
    9. Ningyuan Chen & Guillermo Gallego, 2018. "A Primal-dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint," Papers 1812.09234, arXiv.org, revised Oct 2021.
    10. Zizhuo Wang & Shiming Deng & Yinyu Ye, 2014. "Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems," Operations Research, INFORMS, vol. 62(2), pages 318-331, April.
    11. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    12. Xiao, Baichun & Yang, Wei, 2021. "A Bayesian learning model for estimating unknown demand parameter in revenue management," European Journal of Operational Research, Elsevier, vol. 293(1), pages 248-262.
    13. Thomas Mariotti & Nikolaus Schweizer & Nora Szech & Jonas von Wangenheim, 2023. "Information Nudges and Self-Control," Management Science, INFORMS, vol. 69(4), pages 2182-2197, April.
    14. Thomas Loots & Arnoud V. den Boer, 2023. "Data‐driven collusion and competition in a pricing duopoly with multinomial logit demand," Production and Operations Management, Production and Operations Management Society, vol. 32(4), pages 1169-1186, April.
    15. Victor F. Araman & René A. Caldentey, 2022. "Diffusion Approximations for a Class of Sequential Experimentation Problems," Management Science, INFORMS, vol. 68(8), pages 5958-5979, August.
    16. Athanassios N. Avramidis & Arnoud V. Boer, 2021. "Dynamic pricing with finite price sets: a non-parametric approach," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(1), pages 1-34, August.
    17. N. Bora Keskin & John R. Birge, 2019. "Dynamic Selling Mechanisms for Product Differentiation and Learning," Operations Research, INFORMS, vol. 67(4), pages 1069-1089, July.
    18. Athanassios N. Avramidis, 2020. "A pricing problem with unknown arrival rate and price sensitivity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 92(1), pages 77-106, August.
    19. Yang, Chaolin & Xiong, Yi, 2020. "Nonparametric advertising budget allocation with inventory constraint," European Journal of Operational Research, Elsevier, vol. 285(2), pages 631-641.
    20. Kolotilin, Anton & Li, Hongyi, 2021. "Relational communication," Theoretical Economics, Econometric Society, vol. 16(4), November.

    More about this item

    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:ecl:stabus:3865. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/gsstaus.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.