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

The Economics of No-regret Learning Algorithms

Author

Listed:
  • Jason Hartline

Abstract

A fundamental challenge for modern economics is to understand what happens when actors in an economy are replaced with algorithms. Like rationality has enabled understanding of outcomes of classical economic actors, no-regret can enable the understanding of outcomes of algorithmic actors. This review article covers the classical computer science literature on no-regret algorithms to provide a foundation for an overview of the latest economics research on no-regret algorithms, focusing on the emerging topics of manipulation, statistical inference, and algorithmic collusion.

Suggested Citation

  • Jason Hartline, 2026. "The Economics of No-regret Learning Algorithms," Papers 2601.22079, arXiv.org.
    • Handle: RePEc:arx:papers:2601.22079
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. MOULIN, Hervé & VIAL, Jean-Philippe, 1978. "Strategically zero-sum games: the class of games whose completely mixed equilibria connot be improved upon," LIDAM Reprints CORE 359, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Timo Klein, 2021. "Autonomous algorithmic collusion: Q‐learning under sequential pricing," RAND Journal of Economics, RAND Corporation, vol. 52(3), pages 538-558, September.
    3. Robert J. Aumann, 2025. "Correlated Equilibrium as an Expression of Bayesian Rationality," World Scientific Book Chapters, in: SELECTED CONTRIBUTIONS TO GAME THEORY, chapter 7, pages 175-200, World Scientific Publishing Co. Pte. Ltd..
    4. Jason D. Hartline & Sheng Long & Chenhao Zhang, 2024. "Regulation of Algorithmic Collusion," Papers 2401.15794, arXiv.org, revised Sep 2024.
    5. Robert J. Aumann, 2025. "Subjectivity and Correlation in Randomized Strategies," World Scientific Book Chapters, in: SELECTED CONTRIBUTIONS TO GAME THEORY, chapter 4, pages 73-113, World Scientific Publishing Co. Pte. Ltd..
    6. Calvano, Emilio & Calzolari, Giacomo & Denicoló, Vincenzo & Pastorello, Sergio, 2021. "Algorithmic collusion with imperfect monitoring," International Journal of Industrial Organization, Elsevier, vol. 79(C).
    7. Foster, Dean P. & Vohra, Rakesh V., 1997. "Calibrated Learning and Correlated Equilibrium," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 40-55, October.
    8. Martino Banchio & Andrzej Skrzypacz, 2022. "Artificial Intelligence and Auction Design," NBER Chapters, in: Economics of Artificial Intelligence, National Bureau of Economic Research, Inc.
    9. Modibo Camara & Jason Hartline & Aleck Johnsen, 2020. "Mechanisms for a No-Regret Agent: Beyond the Common Prior," Papers 2009.05518, arXiv.org.
    10. Sergiu Hart & Andreu Mas-Colell, 2013. "A Simple Adaptive Procedure Leading To Correlated Equilibrium," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 2, pages 17-46, World Scientific Publishing Co. Pte. Ltd..
    11. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    12. Joseph E Harrington, 2018. "Developing Competition Law For Collusion By Autonomous Artificial Agents," Journal of Competition Law and Economics, Oxford University Press, vol. 14(3), pages 331-363.
    13. Young, H. Peyton, 2004. "Strategic Learning and its Limits," OUP Catalogue, Oxford University Press, number 9780199269181.
    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. Jason Hartline, 2026. "Clarification of `Algorithmic Collusion without Threats'," Papers 2602.22232, arXiv.org.

    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. Soham R. Phade & Venkat Anantharam, 2023. "Learning in Games with Cumulative Prospect Theoretic Preferences," Dynamic Games and Applications, Springer, vol. 13(1), pages 265-306, March.
    2. Ozdogan, Ayca & Saglam, Ismail, 2021. "Correlated equilibrium under costly disobedience," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 98-104.
    3. Forges, Françoise & Ray, Indrajit, 2024. "“Subjectivity and correlation in randomized strategies”: Back to the roots," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    4. Friedman, Daniel & Rabanal, Jean Paul & Rud, Olga A. & Zhao, Shuchen, 2022. "On the empirical relevance of correlated equilibrium," Journal of Economic Theory, Elsevier, vol. 205(C).
    5. Konstantinos Georgalos & Indrajit Ray & Sonali SenGupta, 2020. "Nash versus coarse correlation," Experimental Economics, Springer;Economic Science Association, vol. 23(4), pages 1178-1204, December.
    6. Ehud Lehrer & Eilon Solan, 2007. "Learning to play partially-specified equilibrium," Levine's Working Paper Archive 122247000000001436, David K. Levine.
    7. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
    8. Arifovic, Jasmina & Boitnott, Joshua F. & Duffy, John, 2019. "Learning correlated equilibria: An evolutionary approach," Journal of Economic Behavior & Organization, Elsevier, vol. 157(C), pages 171-190.
    9. Grant, Simon & Stauber, Ronald, 2022. "Delegation and ambiguity in correlated equilibrium," Games and Economic Behavior, Elsevier, vol. 132(C), pages 487-509.
    10. Burkhard C. Schipper, 2022. "Strategic Teaching and Learning in Games," American Economic Journal: Microeconomics, American Economic Association, vol. 14(3), pages 321-352, August.
    11. Jason D. Hartline & Sheng Long & Chenhao Zhang, 2024. "Regulation of Algorithmic Collusion," Papers 2401.15794, arXiv.org, revised Sep 2024.
    12. Sergiu Hart & Yishay Mansour, 2013. "How Long To Equilibrium? The Communication Complexity Of Uncoupled Equilibrium Procedures," World Scientific Book Chapters, in: Simple Adaptive Strategies From Regret-Matching to Uncoupled Dynamics, chapter 10, pages 215-249, World Scientific Publishing Co. Pte. Ltd..
    13. Soham R. Phade & Venkat Anantharam, 2019. "On the Geometry of Nash and Correlated Equilibria with Cumulative Prospect Theoretic Preferences," Decision Analysis, INFORMS, vol. 16(2), pages 142-156, June.
    14. Trivikram Dokka Venkata Satyanaraya & Herve Moulin & Indrajit Ray & Sonali Sen Gupta, 2020. "Equilibrium Design by Coarse Correlation in Quadratic Games," Working Papers 301895429, Lancaster University Management School, Economics Department.
    15. Kam-Chau Wong & Chongmin Kim, 2004. "Evolutionarily Stable Correlation," Econometric Society 2004 Far Eastern Meetings 495, Econometric Society.
    16. Stoltz, Gilles & Lugosi, Gabor, 2007. "Learning correlated equilibria in games with compact sets of strategies," Games and Economic Behavior, Elsevier, vol. 59(1), pages 187-208, April.
    17. Moulin, Herve & Ray, Indrajit & Sen Gupta, Sonali, 2014. "Improving Nash by coarse correlation," Journal of Economic Theory, Elsevier, vol. 150(C), pages 852-865.
    18. Ayan Bhattacharya, 2019. "On Adaptive Heuristics that Converge to Correlated Equilibrium," Games, MDPI, vol. 10(1), pages 1-11, January.
    19. Trivikram Dokka & Hervé Moulin & Indrajit Ray & Sonali SenGupta, 2023. "Equilibrium design in an n-player quadratic game," Review of Economic Design, Springer;Society for Economic Design, vol. 27(2), pages 419-438, June.
    20. Georgalos, Konstantinos & Ray, Indrajit & Gupta, Sonali Sen, 2019. "Nash vs. Coarse Correlation," Cardiff Economics Working Papers E2019/3, Cardiff University, Cardiff Business School, Economics Section.

    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:2601.22079. 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.