IDEAS home Printed from https://ideas.repec.org/p/cpr/ceprdp/18476.html
   My bibliography  Save this paper

Buyer-Optimal Algorithmic Consumption

Author

Listed:
  • Ichihashi, Shota
  • Smolin, Alex

Abstract

We analyze a bilateral trade model in which the buyer's value for the product and the seller's costs are uncertain, the seller chooses the product price, and the product is recommended by an algorithm based on its value and price. We characterize an algorithm that maximizes the buyer's expected payoff and show that the optimal algorithm underrecommends the product at high prices and overrecommends at low prices. Higher algorithm precision increases the maximal equilibrium price and may increase prices across all of the seller's costs, whereas informing the seller about the buyer's value results in a mean-preserving spread of equilibrium prices and a mean-preserving contraction of the buyer's payoff.

Suggested Citation

  • Ichihashi, Shota & Smolin, Alex, 2023. "Buyer-Optimal Algorithmic Consumption," CEPR Discussion Papers 18476, C.E.P.R. Discussion Papers.
  • Handle: RePEc:cpr:ceprdp:18476
    as

    Download full text from publisher

    File URL: https://cepr.org/publications/DP18476
    Download Restriction: CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org
    ---><---

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

    Other versions of this item:

    References listed on IDEAS

    as
    1. Anne-Katrin Roesler & Balázs Szentes, 2017. "Buyer-Optimal Learning and Monopoly Pricing," American Economic Review, American Economic Association, vol. 107(7), pages 2072-2080, July.
    2. Francesco Decarolis & Gabriele Rovigatti, 2021. "From Mad Men to Maths Men: Concentration and Buyer Power in Online Advertising," American Economic Review, American Economic Association, vol. 111(10), pages 3299-3327, October.
    3. Baron, David P & Myerson, Roger B, 1982. "Regulating a Monopolist with Unknown Costs," Econometrica, Econometric Society, vol. 50(4), pages 911-930, July.
    4. Roesler, Anne-Katrin & Deb, Rahul, 2021. "Multi-Dimensional Screening: Buyer-Optimal Learning and Informational Robustness," CEPR Discussion Papers 16206, C.E.P.R. Discussion Papers.
    5. Justin P. Johnson & David P. Myatt, 2006. "On the Simple Economics of Advertising, Marketing, and Product Design," American Economic Review, American Economic Association, vol. 96(3), pages 756-784, June.
    6. Matthew Gentzkow & Emir Kamenica, 2016. "A Rothschild-Stiglitz Approach to Bayesian Persuasion," American Economic Review, American Economic Association, vol. 106(5), pages 597-601, May.
    7. Andrei Hagiu & Tat‐How Teh & Julian Wright, 2022. "Should platforms be allowed to sell on their own marketplaces?," RAND Journal of Economics, RAND Corporation, vol. 53(2), pages 297-327, June.
    8. Nicola Persico, 2000. "Information Acquisition in Auctions," Econometrica, Econometric Society, vol. 68(1), pages 135-148, January.
    9. Milgrom, Paul R & Weber, Robert J, 1982. "A Theory of Auctions and Competitive Bidding," Econometrica, Econometric Society, vol. 50(5), pages 1089-1122, September.
    10. Simon Loertscher & Leslie M. Marx, 2022. "Incomplete Information Bargaining with Applications to Mergers, Investment, and Vertical Integration," American Economic Review, American Economic Association, vol. 112(2), pages 616-649, February.
    11. Julapa Jagtiani & Catharine Lemieux, 2019. "The roles of alternative data and machine learning in fintech lending: Evidence from the LendingClub consumer platform," Financial Management, Financial Management Association International, vol. 48(4), pages 1009-1029, December.
    12. Andrei Hagiu & Bruno Jullien, 2011. "Why do intermediaries divert search?," RAND Journal of Economics, RAND Corporation, vol. 42(2), pages 337-362, June.
    13. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    14. Kai Hao Yang, 2022. "Selling Consumer Data for Profit: Optimal Market-Segmentation Design and Its Consequences," American Economic Review, American Economic Association, vol. 112(4), pages 1364-1393, April.
    15. Juan-JosÈ Ganuza & JosÈ S. Penalva, 2010. "Signal Orderings Based on Dispersion and the Supply of Private Information in Auctions," Econometrica, Econometric Society, vol. 78(3), pages 1007-1030, May.
    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. Li, Yunan, 2019. "Efficient mechanisms with information acquisition," Journal of Economic Theory, Elsevier, vol. 182(C), pages 279-328.
    2. Shi, Xianwen, 2012. "Optimal auctions with information acquisition," Games and Economic Behavior, Elsevier, vol. 74(2), pages 666-686.
    3. Zhou, Jidong, 2021. "Mixed bundling in oligopoly markets," Journal of Economic Theory, Elsevier, vol. 194(C).
    4. Szalay, Dezsö, 2009. "Contracts with endogenous information," Games and Economic Behavior, Elsevier, vol. 65(2), pages 586-625, March.
    5. Maxim Ivanov, 2021. "Optimal monotone signals in Bayesian persuasion mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(3), pages 955-1000, October.
    6. Yang, Kai Hao, 2023. "On the continuity of outcomes in a monopoly market," Journal of Mathematical Economics, Elsevier, vol. 108(C).
    7. Yunan Li, 2017. "Efficient Mechanisms with Information Acquisition," PIER Working Paper Archive 16-007, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jun 2017.
    8. Maryam Saeedi & Ali Shourideh, 2020. "Optimal Rating Design under Moral Hazard," Papers 2008.09529, arXiv.org, revised Jul 2023.
    9. Dirk Bergemann & Alessandro Bonatti, 2024. "Data, Competition, and Digital Platforms," American Economic Review, American Economic Association, vol. 114(8), pages 2553-2595, August.
    10. Juan-José Ganuza & Jos Jansen, 2013. "Too Much Information Sharing? Welfare Effects of Sharing Acquired Cost Information in Oligopoly," Journal of Industrial Economics, Wiley Blackwell, vol. 61(4), pages 845-876, December.
    11. Schweizer, Nikolaus & Szech, Nora, 2017. "Revenues and welfare in auctions with information release," Journal of Economic Theory, Elsevier, vol. 170(C), pages 86-111.
    12. Emir Kamenica & Matthew Gentzkow, 2011. "Bayesian Persuasion," American Economic Review, American Economic Association, vol. 101(6), pages 2590-2615, October.
    13. Hao Li & Xianwen Shi, 2017. "Discriminatory Information Disclosure," American Economic Review, American Economic Association, vol. 107(11), pages 3363-3385, November.
    14. Hernando-Veciana, Ángel, 2009. "Information acquisition in auctions: Sealed bids vs. open bids," Games and Economic Behavior, Elsevier, vol. 65(2), pages 372-405, March.
    15. Dirk Bergemann & Tibor Heumann & Stephen Morris, 2022. "Screening with Persuasion," Cowles Foundation Discussion Papers 2338, Cowles Foundation for Research in Economics, Yale University.
    16. Hanming Fang & Stephen Morris, 2012. "Multidimensional Private Value Auctions," World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 9, pages 319-356, World Scientific Publishing Co. Pte. Ltd..
    17. Péter Esö & Lucy White, 2004. "Precautionary Bidding in Auctions," Econometrica, Econometric Society, vol. 72(1), pages 77-92, January.
    18. Carroni, Elias & Ferrari, Luca & Righi, Simone, 2019. "The price of discovering your needs online," Journal of Economic Behavior & Organization, Elsevier, vol. 164(C), pages 317-330.
    19. Anja Prummer, "undated". "Discrimination in Promotion," Working Papers 905, Queen Mary University of London, School of Economics and Finance.
    20. Chaves, Isaías N. & Ichihashi, Shota, 2024. "Auction timing and market thickness," Games and Economic Behavior, Elsevier, vol. 143(C), pages 161-178.

    More about this item

    Keywords

    Algorithmic consumption;

    JEL classification:

    • D42 - Microeconomics - - Market Structure, Pricing, and Design - - - Monopoly
    • 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

    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:cpr:ceprdp:18476. 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://www.cepr.org .

    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.