IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2606.05363.html

Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion

Author

Listed:
  • Yuhang Wu
  • Assaf Zeevi

Abstract

On a platform with many sellers, should a pricing algorithm explicitly model competitors' prices when learning demand? Classical learning arguments suggest an affirmative answer: ignoring competitors induces model misspecification and inefficiency. In contrast, recent work on algorithmic collusion suggests that strategic obliviousness -- deliberately ignoring competitor prices -- may facilitate collusive outcomes and improve profits. We study this modeling choice in a stylized competitive market with unknown noisy demand, in which multiple sellers repeatedly set prices and estimate demand via iterated least squares, and either incorporate competitors' prices into their demand models (informed) or ignore them (oblivious). We first show that, relative to a monopolist, an oblivious seller in a competitive market must explore more aggressively to compensate for the loss of dynamic competitor information. Building on this insight, we characterize market dynamics when all sellers are oblivious and show that prices converge to the competitive outcome under sufficient exploration, while a continuum of pseudo-equilibria arises when exploration decays. Analyzing the resulting price trajectories, we uncover an excursion phenomenon that gives rise to transient collusive patterns that dissipate as learning progresses. In markets with both oblivious and informed sellers, the informed strictly out-earn the oblivious. Read as a strategy game, the modeling choice has a unique Nash equilibrium: the all-informed market, in which prices converge to the competitive outcome efficiently. Overall, our results indicate that collusive patterns are not robust and are not sustained by oblivious modeling; therefore, incorporating competitor information, together with sufficient price exploration, remains a reliable strategy for sellers in competitive markets.

Suggested Citation

  • Yuhang Wu & Assaf Zeevi, 2026. "Should Demand Models Incorporate Competitor Prices? Oblivious Learning and Algorithmic Collusion," Papers 2606.05363, arXiv.org, revised Jun 2026.
  • Handle: RePEc:arx:papers:2606.05363
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2606.05363
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ming Chen & Zhi-Long Chen, 2015. "Recent Developments in Dynamic Pricing Research: Multiple Products, Competition, and Limited Demand Information," Production and Operations Management, Production and Operations Management Society, vol. 24(5), pages 704-731, May.
    2. Emilio Calvano & Giacomo Calzolari & Vincenzo Denicolò & Sergio Pastorello, 2020. "Artificial Intelligence, Algorithmic Pricing, and Collusion," American Economic Review, American Economic Association, vol. 110(10), pages 3267-3297, October.
    3. Abada, Ibrahim & Lambin, Xavier & Tchakarov, Nikolay, 2024. "Collusion by mistake: Does algorithmic sophistication drive supra-competitive profits?," European Journal of Operational Research, Elsevier, vol. 318(3), pages 927-953.
    4. Osborne, Martin J. & Pitchik, Carolyn, 1983. "Profit-sharing in a collusive industry," European Economic Review, Elsevier, vol. 22(1), pages 59-74, June.
    5. Ignacio Esponda & Demian Pouzo, 2016. "Berk–Nash Equilibrium: A Framework for Modeling Agents With Misspecified Models," Econometrica, Econometric Society, vol. 84, pages 1093-1130, May.
    6. Milgrom, Paul & Roberts, John, 1990. "Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities," Econometrica, Econometric Society, vol. 58(6), pages 1255-1277, November.
    7. Milgrom, Paul & Roberts, John, 1991. "Adaptive and sophisticated learning in normal form games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 82-100, February.
    8. Shukai Li & Sanjay Mehrotra, 2026. "Adaptive Learning in Uncertain and Sequential Competition," Operations Research, INFORMS, vol. 74(1), pages 301-338, January.
    9. 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.
    10. Omar Besbes & Yonatan Gur & Assaf Zeevi, 2015. "Non-Stationary Stochastic Optimization," Operations Research, INFORMS, vol. 63(5), pages 1227-1244, October.
    11. Zach Y. Brown & Alexander MacKay, 2023. "Competition in Pricing Algorithms," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 109-156, May.
    12. Choné, Philippe & Linnemer, Laurent, 2020. "Linear demand systems for differentiated goods: Overview and user’s guide," International Journal of Industrial Organization, Elsevier, vol. 73(C).
    13. Karsten T. Hansen & Kanishka Misra & Mallesh M. Pai, 2021. "Frontiers: Algorithmic Collusion: Supra-competitive Prices via," Marketing Science, INFORMS, vol. 40(1), pages 1-12, January.
    14. 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.
    15. Omar Besbes & Assaf Zeevi, 2015. "On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning," Management Science, INFORMS, vol. 61(4), pages 723-739, April.
    16. Nirvikar Singh & Xavier Vives, 1984. "Price and Quantity Competition in a Differentiated Duopoly," RAND Journal of Economics, The RAND Corporation, vol. 15(4), pages 546-554, Winter.
    17. 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.
    18. Hamsa Bastani & Mohsen Bayati & Khashayar Khosravi, 2021. "Mostly Exploration-Free Algorithms for Contextual Bandits," Management Science, INFORMS, vol. 67(3), pages 1329-1349, March.
    19. William L. Cooper & Tito Homem-de-Mello & Anton J. Kleywegt, 2015. "Learning and Pricing with Models That Do Not Explicitly Incorporate Competition," Operations Research, INFORMS, vol. 63(1), pages 86-103, February.
    20. Mila Nambiar & David Simchi-Levi & He Wang, 2019. "Dynamic Learning and Pricing with Model Misspecification," Management Science, INFORMS, vol. 65(11), pages 4980-5000, November.
    21. Martin Bichler & Julius Durmann & Matthias Oberlechner, 2025. "Algorithmic Pricing and Algorithmic Collusion," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 67(6), pages 971-979, December.
    22. Ibrahim Abada & Xavier Lambin, 2023. "Artificial Intelligence: Can Seemingly Collusive Outcomes Be Avoided?," Management Science, INFORMS, vol. 69(9), pages 5042-5065, September.
    23. Fischer, Christian & Normann, Hans-Theo, 2019. "Collusion and bargaining in asymmetric Cournot duopoly—An experiment," European Economic Review, Elsevier, vol. 111(C), pages 360-379.
    24. Stephanie Assad & Robert Clark & Daniel Ershov & Lei Xu, 2024. "Algorithmic Pricing and Competition: Empirical Evidence from the German Retail Gasoline Market," Journal of Political Economy, University of Chicago Press, vol. 132(3), pages 723-771.
    25. Janusz M. Meylahn & Arnoud V. den Boer, 2022. "Learning to Collude in a Pricing Duopoly," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2577-2594, September.
    26. 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.
    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. Shengyu Cao & Ming Hu, 2026. "Supracompetitive Pricing Under AI Monoculture," Papers 2601.01279, arXiv.org, revised Jun 2026.
    2. Jackie Baek & Vivek F. Farias & Farrell Wu, 2026. "Misspecified Estimate-then-Optimize Leads to Supra-Competitive Prices," Papers 2605.16064, arXiv.org, revised Jun 2026.
    3. 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.
    4. Yang, Xiangyu & Zhang, Jianghua & Hu, Jian-Qiang & Hu, Jiaqiao, 2024. "Nonparametric multi-product dynamic pricing with demand learning via simultaneous price perturbation," European Journal of Operational Research, Elsevier, vol. 319(1), pages 191-205.
    5. Shidi Deng & Maximilian Schiffer & Martin Bichler, 2025. "Exploring Competitive and Collusive Behaviors in Algorithmic Pricing with Deep Reinforcement Learning," Papers 2503.11270, arXiv.org.
    6. Jianyu Xu & Yu-Xiang Wang, 2026. "Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand," Papers 2605.05609, arXiv.org.
    7. 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.
    8. Woonghee Tim Huh & Michael Jong Kim & Meichun Lin, 2022. "Bayesian dithering for learning: Asymptotically optimal policies in dynamic pricing," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3576-3593, September.
    9. Gillian K. Hadfield & Andrew Koh, 2025. "An Economy of AI Agents," NBER Chapters, in: The Economics of Transformative AI, National Bureau of Economic Research, Inc.
    10. Peter Seele & Claus Dierksmeier & Reto Hofstetter & Mario D. Schultz, 2021. "Mapping the Ethicality of Algorithmic Pricing: A Review of Dynamic and Personalized Pricing," Journal of Business Ethics, Springer, vol. 170(4), pages 697-719, May.
    11. Yi Zheng & Juxihong Julaiti & Guodong Pang, 2024. "Adaptive service rate control of an M/M/1 queue with server breakdowns," Queueing Systems: Theory and Applications, Springer, vol. 106(1), pages 159-191, February.
    12. Boxiao Chen & David Simchi-Levi & Yining Wang & Yuan Zhou, 2022. "Dynamic Pricing and Inventory Control with Fixed Ordering Cost and Incomplete Demand Information," Management Science, INFORMS, vol. 68(8), pages 5684-5703, August.
    13. Abada, Ibrahim & Lambin, Xavier & Tchakarov, Nikolay, 2024. "Collusion by mistake: Does algorithmic sophistication drive supra-competitive profits?," European Journal of Operational Research, Elsevier, vol. 318(3), pages 927-953.
    14. Janusz M. Meylahn & Arnoud V. den Boer, 2022. "Learning to Collude in a Pricing Duopoly," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2577-2594, September.
    15. Joon Suk Huh & Ellen Vitercik & Kirthevasan Kandasamy, 2024. "Bandit Profit-maximization for Targeted Marketing," Papers 2403.01361, arXiv.org, revised Jul 2024.
    16. Jianqing Fan & Yongyi Guo & Mengxin Yu, 2024. "Policy Optimization Using Semiparametric Models for Dynamic Pricing," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 119(545), pages 552-564, January.
    17. Lambin, Xavier & Raizonville, Adrien, 2025. "From black box to glass box: algorithmic explainability as a strategic decision," Information Economics and Policy, Elsevier, vol. 71(C).
    18. 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.
    19. Gillian K. Hadfield & Andrew Koh, 2025. "An Economy of AI Agents," Papers 2509.01063, arXiv.org.
    20. Doan, Xuan Vinh & Lei, Xiao & Shen, Siqian, 2020. "Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications," European Journal of Operational Research, Elsevier, vol. 282(1), pages 235-251.

    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:arx:papers:2606.05363. 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: arXiv administrators (email available below). General contact details of provider: https://arxiv.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.