IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2403.07177.html
   My bibliography  Save this paper

Collusive Outcomes Without Collusion

Author

Listed:
  • Inkoo Cho
  • Noah Williams

Abstract

We develop a model of algorithmic pricing that shuts down every channel for explicit or implicit collusion while still generating collusive outcomes. We analyze the dynamics of a duopoly market where both firms use pricing algorithms consisting of a parameterized family of model specifications. The firms update both the parameters and the weights on models to adapt endogenously to market outcomes. We show that the market experiences recurrent episodes where both firms set prices at collusive levels. We analytically characterize the dynamics of the model, using large deviation theory to explain the recurrent episodes of collusive outcomes. Our results show that collusive outcomes may be a recurrent feature of algorithmic environments with complementarities and endogenous adaptation, providing a challenge for competition policy.

Suggested Citation

  • Inkoo Cho & Noah Williams, 2024. "Collusive Outcomes Without Collusion," Papers 2403.07177, arXiv.org.
    • Handle: RePEc:arx:papers:2403.07177
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. Marcet, Albert & Sargent, Thomas J., 1989. "Convergence of least squares learning mechanisms in self-referential linear stochastic models," Journal of Economic Theory, Elsevier, vol. 48(2), pages 337-368, August.
    2. Martino Banchio & Andrzej Skrzypacz, 2022. "Artificial Intelligence and Auction Design," NBER Chapters, in: Economics of Artificial Intelligence, National Bureau of Economic Research, Inc.
    3. Green, Edward J & Porter, Robert H, 1984. "Noncooperative Collusion under Imperfect Price Information," Econometrica, Econometric Society, vol. 52(1), pages 87-100, January.
    4. Zach Y. Brown & Alexander MacKay, 2023. "Competition in Pricing Algorithms," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 109-156, May.
    5. Mark F. J. Steel, 2020. "Model Averaging and Its Use in Economics," Journal of Economic Literature, American Economic Association, vol. 58(3), pages 644-719, September.
    6. Noah Williams, 2019. "Escape Dynamics in Learning Models," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(2), pages 882-912.
    7. In-Koo Cho & Noah Williams & Thomas J. Sargent, 2002. "Escaping Nash Inflation," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 69(1), pages 1-40.
    8. George W. Evans, 2001. "Expectations in Macroeconomics. Adaptive versus Eductive Learning," Revue Économique, Programme National Persée, vol. 52(3), pages 573-582.
    9. Abreu, Dilip & Pearce, David & Stacchetti, Ennio, 1986. "Optimal cartel equilibria with imperfect monitoring," Journal of Economic Theory, Elsevier, vol. 39(1), pages 251-269, June.
    10. 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.
    11. Martino Banchio & Giacomo Mantegazza, 2022. "Artificial Intelligence and Spontaneous Collusion," Papers 2202.05946, arXiv.org, revised Sep 2023.
    12. Waltman, Ludo & Kaymak, Uzay, 2008. "Q-learning agents in a Cournot oligopoly model," Journal of Economic Dynamics and Control, Elsevier, vol. 32(10), pages 3275-3293, October.
    13. Cho, In-Koo & Matsui, Akihiko, 2005. "Learning aspiration in repeated games," Journal of Economic Theory, Elsevier, vol. 124(2), pages 171-201, October.
    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. Javier D. Donna & Pedro Pereira, 2024. "Structural Presumptions for Non-horizontal Mergers in the 2023 Merger Guidelines: A Primer and a Path Forward," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 65(1), pages 303-345, August.

    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. George W. Evans & Seppo Honkapohja & Kaushik Mitra, 2022. "Expectations, Stagnation, And Fiscal Policy: A Nonlinear Analysis," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 63(3), pages 1397-1425, August.
    2. Calvano, Emilio & Calzolari, Giacomo & Denicoló, Vincenzo & Pastorello, Sergio, 2021. "Algorithmic collusion with imperfect monitoring," International Journal of Industrial Organization, Elsevier, vol. 79(C).
    3. Duffy, John & Shin, Michael, 2024. "Heterogeneous experience and constant-gain learning," Journal of Economic Dynamics and Control, Elsevier, vol. 164(C).
    4. Epivent, Andréa & Lambin, Xavier, 2024. "On algorithmic collusion and reward–punishment schemes," Economics Letters, Elsevier, vol. 237(C).
    5. Olivier Compte, 2023. "Q-learning with biased policy rules," Papers 2304.12647, arXiv.org, revised Oct 2023.
    6. Ellison, Martin & Scott, Andrew, 2013. "Learning and price volatility in duopoly models of resource depletion," Journal of Monetary Economics, Elsevier, vol. 60(7), pages 806-820.
    7. Galimberti, Jaqueson K., 2019. "An approximation of the distribution of learning estimates in macroeconomic models," Journal of Economic Dynamics and Control, Elsevier, vol. 102(C), pages 29-43.
    8. KevinX.D. Huang & Zheng Liu & Tao Zha, 2009. "Learning, Adaptive Expectations and Technology Shocks," Economic Journal, Royal Economic Society, vol. 119(536), pages 377-405, March.
    9. Evans, David & Evans, George W. & McGough, Bruce, 2022. "The RPEs of RBCs and other DSGEs," Journal of Economic Dynamics and Control, Elsevier, vol. 143(C).
    10. Evans, David & Evans, George W. & McGough, Bruce, 2021. "Learning when to say no," Journal of Economic Theory, Elsevier, vol. 194(C).
    11. Gonzalo Ballestero, 2021. "Collusion and Artificial Intelligence: A computational experiment with sequential pricing algorithms under stochastic costs," Young Researchers Working Papers 1, Universidad de San Andres, Departamento de Economia, revised Oct 2022.
    12. Justin P. Johnson & Andrew Rhodes & Matthijs Wildenbeest, 2023. "Platform Design When Sellers Use Pricing Algorithms," Econometrica, Econometric Society, vol. 91(5), pages 1841-1879, September.
    13. Fourberg, Niklas & Marques-Magalhaes, Katrin & Wiewiorra, Lukas, 2022. "They are among us: Pricing behavior of algorithms in the field," WIK Working Papers 6, WIK Wissenschaftliches Institut für Infrastruktur und Kommunikationsdienste GmbH, Bad Honnef.
    14. 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.
    15. Fourberg, Niklas & Marques Magalhaes, Katrin & Wiewiorra, Lukas, 2023. "They Are Among Us: Pricing Behavior of Algorithms in the Field," 32nd European Regional ITS Conference, Madrid 2023: Realising the digital decade in the European Union – Easier said than done? 277958, International Telecommunications Society (ITS).
    16. Gonzalo Ballestero, 2022. "Collusion and Artificial Intelligence: A Computational Experiment with Sequential Pricing Algorithms under Stochastic Costs," Working Papers 118, Red Nacional de Investigadores en Economía (RedNIE).
    17. Martino Banchio & Andrzej Skrzypacz, 2022. "Artificial Intelligence and Auction Design," Papers 2202.05947, arXiv.org.
    18. Malmendier, Ulrike & Nagel, Stefan & Yan, Zhen, 2021. "The making of hawks and doves," Journal of Monetary Economics, Elsevier, vol. 117(C), pages 19-42.
    19. Bernhard Kasberger & Simon Martin & Hans-Theo Normann & Tobias Werner, 2024. "Algorithmic Cooperation," CESifo Working Paper Series 11124, CESifo.
    20. Daniele Condorelli & Massimiliano Furlan, 2023. "Cheap Talking Algorithms," Papers 2310.07867, arXiv.org, revised Oct 2024.

    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:2403.07177. 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: http://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.