Pith. sign in

REVIEW 3 minor 73 references

Optimal Coarse Correlated Equilibria in Mean Field Games: Linear Programming and No-Regret Learning

T0 review · 0 major / 3 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A linear programming formulation finds optimal coarse correlated equilibria in continuous-time mean field games and supports a no-regret learning algorithm with explicit rates.

desk verdict LP formulation for optimal CCE in continuous-time MFGs plus a primal-dual no-regret algorithm with rates. read the letter →

arxiv 2606.20062 v1 pith:ESG4HGVB submitted 2026-06-18 math.OC cs.LGmath.PR

Luciano Campi , Federico Cannerozzi , Ioannis Tzouanas This is my paper · ORCID
classification math.OCcs.LGmath.PR
keywords meanfieldgamescoarsecorrelatedequilibrialinearprogrammingno-regretlearningprimal-dualalgorithmcontinuous-timeoptimal
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper introduces optimal coarse correlated equilibria for continuous-time mean field games, where a moderator selects an equilibrium to optimize a given performance criterion that can differ from the representative player's objective. It develops a linear programming formulation of the problem, proves existence of optimal solutions in this LP setting, and shows how these solutions relate to the original probabilistic definition of equilibria. Building on the LP characterization, the paper presents a primal-dual no-regret algorithm derived from an equivalent Lagrangian form of the external-regret constraints and supplies explicit convergence rates for the iterates. Numerical examples are used to illustrate the approach on concrete instances.

What carries the argument

The linear programming formulation of the optimal coarse correlated equilibrium problem, which relaxes the probabilistic equilibrium conditions into linear inequalities and enables the subsequent Lagrangian-based learning dynamics.

What would settle it

A continuous-time mean field game in which every solution of the stated linear program fails to induce a valid probabilistic coarse correlated equilibrium, or in which the proposed primal-dual iterates do not converge at the claimed rate.

Watch

Extended reading notes

Core claim

Optimal coarse correlated equilibria in continuous-time mean field games admit a linear programming characterization that encodes the moderator's performance criterion together with the no-regret constraints; solutions of the LP correspond to valid probabilistic equilibria, and a primal-dual algorithm based on the Lagrangian of the regret constraint learns such equilibria at explicit rates.

Load-bearing premise

A moderator exists who is allowed to select among mean-field coarse correlated equilibria in order to optimize a performance criterion that may differ from the representative player's objective.

Editorial extensions

If this is right

  • Existence of an optimal LP coarse correlated equilibrium is guaranteed.
  • The LP solutions map back to equilibria in the original probabilistic formulation.
  • The primal-dual algorithm converges to an optimal equilibrium with explicit rates.
  • Numerical illustrations confirm the method on example games.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same LP relaxation might be adapted to compute moderator-optimal equilibria in finite-player or discrete-time games by replacing the mean-field limit with finite-N constraints.
  • Regulators could interpret the moderator as a policy designer and use the learned equilibria to evaluate interventions that improve aggregate outcomes such as congestion or emissions.
  • The Lagrangian approach for external regret may extend to other equilibrium notions in mean field games provided the regret set remains convex.
  • Convergence rates could be tested numerically on larger-scale problems to check whether the explicit bounds remain informative in practice.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper introduces optimal coarse correlated equilibria (CCE) for continuous-time mean field games, where a moderator selects among mean-field CCEs to optimize a performance criterion that may differ from the players' objective. It develops an LP formulation, proves existence of optimal LP CCEs, establishes equivalence to the original probabilistic definition, and designs a primal-dual no-regret algorithm derived from the Lagrangian of the external-regret constraint, providing explicit convergence rates along with numerical examples.

Significance. If the LP equivalence and convergence results hold, the work offers a computationally tractable characterization and learning procedure for a moderator-optimized equilibrium concept in continuous-time MFGs. The explicit rates for the primal-dual algorithm and the direct link between LP and probabilistic formulations are notable strengths that could facilitate further algorithmic development in mean-field game theory.

minor comments (3)
  1. The abstract states that the LP formulation is related to the probabilistic setting, but without an explicit theorem number or section reference in the provided description, it is unclear where the equivalence proof appears; adding a forward reference would improve readability.
  2. Numerical examples are mentioned but no details are given on the specific mean-field interaction kernel or discretization scheme used; including these would aid reproducibility.
  3. The continuous-time setting is central, yet the abstract does not indicate whether the LP is formulated over a finite horizon or with discounting; clarifying this in the problem statement would prevent ambiguity for readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our work and for recommending minor revision. The referee's description accurately reflects the paper's contributions on LP formulations for optimal CCE in continuous-time MFGs, existence results, equivalence to probabilistic definitions, and the primal-dual no-regret algorithm with convergence rates. No major comments were raised in the report.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity in derivation chain

full rationale

The central claims rest on an LP reformulation of optimal mean-field CCE derived from standard probabilistic definitions of coarse correlated equilibria, an existence result for the LP optimum, an equivalence proof back to the original setting, and a primal-dual no-regret algorithm obtained from the Lagrangian of the external-regret constraint. The moderator selecting among CCEs according to a possibly different criterion is stated explicitly as part of the problem formulation rather than derived or assumed without support. No equations reduce by construction to fitted parameters, self-citations, or ansatzes; the derivation chain is self-contained against external benchmarks in convex optimization and mean-field game theory.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The formulation relies on standard assumptions from mean-field game theory (existence of equilibria, well-posed dynamics) that are not introduced as new axioms here; no free parameters or invented entities are visible in the abstract.

assumptions (1)
  • domain assumption Mean-field coarse correlated equilibria exist for the continuous-time game under consideration
    Invoked when stating that the moderator selects among all such equilibria

how reviews work

0 comments
Cite this review

Pith. "Pith review of Optimal Coarse Correlated Equilibria in Mean Field Games: Linear Programming and No-Regret Learning." pith.science (2026). https://pith.science/paper/ESG4HGVB

@misc{pith2026260620062,
  author       = {Pith},
  title        = {Pith review of: Optimal Coarse Correlated Equilibria in Mean Field Games: Linear Programming and No-Regret Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ESG4HGVB}},
  note         = {Machine review of arXiv:2606.20062}
}
read the original abstract

We introduce optimal coarse correlated equilibria for continuous-time mean field games. A coarse correlated equilibrium is a randomized recommendation scheme from which no player can gain by ignoring the recommendation and switching to an alternative strategy. The problem is as follows: a moderator selects, among all mean-field coarse correlated equilibria, one that optimizes a prescribed performance criterion, which may differ from the representative player's objective. After formulating the problem, we develop a linear programming (LP) formulation, prove the existence of optimal LP coarse correlated equilibria, and relate the LP characterization to the original probabilistic setting. Building on this characterization, we design a no-regret primal-dual algorithm, based on an equivalent Lagrangian formulation of the external-regret constraint, for learning such equilibria. We provide explicit convergence rates for the learning algorithm, and numerical examples illustrate the method.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

73 extracted references · 5 canonical work pages

  1. [1]

    ALIPRANTIS ANDK

    C. ALIPRANTIS ANDK. BORDER,Infinite Dimensional Analysis: A Hitchhiker’s Guide, Studies in Economic Theory, Springer Berlin Heidelberg, 2013

    2013

  2. [2]

    AMBROSIO, N

    L. AMBROSIO, N. FUSCO,ANDD. PALLARA,Functions of bounded variation and free discon- tinuity problems, Oxford Mathematical Monographs, The Clarendon Press, Oxford University Press, New York, 2000

    2000

  3. [3]

    ANAGNOSTIDES, G

    I. ANAGNOSTIDES, G. FARINA, I. PANAGEAS,ANDT. SANDHOLM,Optimistic mirror descent either converges to nash or to strong coarse correlated equilibria in bimatrix games, in Advances in Neural Information Processing Systems, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, eds., vol. 35, Curran Associates, Inc., 2022, pp. 16439–16454

    2022

  4. [4]

    AUBIN-FRANKOWSKI, A

    P.-C. AUBIN-FRANKOWSKI, A. KORBA,ANDF. L ´EGER,Mirror descent with relative smooth- ness in measure spaces, with application to sinkhorn and em, in Advances in Neural Information Processing Systems, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh, eds., vol. 35, Curran Associates, Inc., 2022, pp. 17263–17275

    2022

  5. [5]

    R. J. AUMANN,Subjectivity and correlation in randomized strategies, J. Math. Econom., 1 (1974), pp. 67–96

    1974

  6. [6]

    ,Correlated equilibrium as an expression of Bayesian rationality, Econometrica, 55 (1987), pp. 1–18

    1987

  7. [7]

    BACCELLI, B

    F. BACCELLI, B. BLASZCZYSZYN,ANDM. K. KARRAY,Random Measures, Point Processes, and Stochastic Geometry, Inria, July 2024

    2024

  8. [8]

    BECK ANDM

    A. BECK ANDM. TEBOULLE,Mirror descent and nonlinear projected subgradient methods for convex optimization, Operations Research Letters, 31 (2003), pp. 167–175

    2003

Show all 73 references
  1. [9]

    BLUM ANDY

    A. BLUM ANDY. MANSOUR,Learning, Regret Minimization, and Equilibria, Cambridge Uni- versity Press, 2007, p. 79–102. 52 CAMPI, CANNEROZZI, AND TZOUANAS

    2007

  2. [10]

    BOGACHEV, N

    V. BOGACHEV, N. KRYLOV, M. R ¨OCKNER,ANDS. SHAPOSHNIKOV,Fokker-Planck- Kolmogorov Equations, Mathematical Surveys and Monographs, American Mathematical So- ciety, 2015

    2015

  3. [11]

    BONESINI, L

    O. BONESINI, L. CAMPI,ANDM. FISCHER,Correlated equilibria for mean field games with progressive strategies, Mathematics of Operations Research, 50 (2025), pp. 1072–1111

    2025

  4. [12]

    BOUVERET, R

    G. BOUVERET, R. DUMITRESCU,ANDP. TANKOV,Mean-field games of optimal stopping: a relaxed solution approach, SIAM J. Control Optim., 58 (2020), pp. 1795–1821

    2020

  5. [13]

    Y. CAI, C. DASKALAKIS, H. LUO, C.-Y. WEI,ANDW. ZHENG,Proximal regret and proximal correlated equilibria: A new tractable solution concept for online learning and games, arXiv preprint arXiv:2511.01852, (2025)

    2025

  6. [14]

    CAMPI, F

    L. CAMPI, F. CANNEROZZI,ANDF. CARTELLIER,Coarse correlated equilibria in linear qua- dratic mean field games and application to an emission abatement game, Appl. Math. Optim., 91 (2025), pp. Paper No. 8, 40

    2025

  7. [15]

    CAMPI, F

    L. CAMPI, F. CANNEROZZI,ANDM. FISCHER,Coarse correlated equilibria for continuous time mean field games in open loop strategies, Electron. J. Probab., 29 (2024), pp. Paper No. 196, 56

    2024

  8. [16]

    CAMPI ANDM

    L. CAMPI ANDM. FISCHER,Correlated equilibria and mean field games: a simple model, Math. Oper. Res., 47 (2022), pp. 2240–2259

    2022

  9. [17]

    CANNEROZZI,Coarse correlated equilibria in continuous-time mean field games, PhD thesis, Universit`a degli Studi di Milano, Milan, Italy, 2025

    F. CANNEROZZI,Coarse correlated equilibria in continuous-time mean field games, PhD thesis, Universit`a degli Studi di Milano, Milan, Italy, 2025

    2025

  10. [18]

    CANNEROZZI ANDG

    F. CANNEROZZI ANDG. FERRARI,Cooperation, correlation, and competition in ergodic n- player games and mean-field games of singular controls: A case study, Mathematics of Opera- tions Research, (2026)

    2026

  11. [19]

    CARDALIAGUET, PIERRE ANDHADIKHANLOO, SAEED,Learning in mean field games: The fictitious play, ESAIM: COCV , 23 (2017), pp. 569–591

    2017

  12. [20]

    CARMONA ANDF

    R. CARMONA ANDF. DELARUE,Probabilistic theory of mean field games with applications I, (Springer), 2018

    2018

  13. [21]

    CARMONA ANDF.C

    R. CARMONA ANDF.C. DELARUE,Probabilistic theory of mean field games with applications. II, vol. 84 of Probability Theory and Stochastic Modelling, Springer, Cham, 2018. Mean field games with common noise and master equations

    2018

  14. [22]

    CESA-BIANCHI ANDG

    N. CESA-BIANCHI ANDG. LUGOSI,Prediction, Learning, and Games, Cambridge University Press, 2006

    2006

  15. [23]

    CHAMBOLLE ANDJ

    A. CHAMBOLLE ANDJ. P. CONTRERAS,Accelerated bregman primal-dual methods applied to optimal transport and wasserstein barycenter problems, SIAM Journal on Mathematics of Data Science, 4 (2022), pp. 1369–1395

    2022

  16. [24]

    CHAMBOLLE ANDT

    A. CHAMBOLLE ANDT. POCK,A first-order primal-dual algorithm for convex problems with applications to imaging, Journal of Mathematical Imaging and Vision, 40 (2011)

    2011

  17. [25]

    CHEN ANDM

    G. CHEN ANDM. TEBOULLE,Convergence analysis of a proximal-like minimization algorithm using bregman functions, SIAM Journal on Optimization, 3 (1993), pp. 538–543

    1993

  18. [26]

    DAYANIKLI ANDM

    G. DAYANIKLI ANDM. LAURI `ERE,A machine learning method for stackelberg mean field games, Mathematics of Operations Research, 50 (2025), pp. 3055–3093

    2025

  19. [27]

    DIANETTI, G

    J. DIANETTI, G. FERRARI, M. FISCHER,ANDM. NENDEL,Submodular mean field games: existence and approximation of solutions, Ann. Appl. Probab., 31 (2021), pp. 2538–2566

    2021

  20. [28]

    ,A unifying framework for submodular mean field games, Math. Oper. Res., 48 (2023), pp. 1679–1710

    2023

  21. [29]

    DOKKA, H

    T. DOKKA, H. MOULIN, I. RAY,ANDS. SENGUPTA,Equilibrium design in an n-player qua- dratic game, Review of Economic Design, 27 (2023), pp. 419–438

    2023

  22. [30]

    J. DONG, B. WANG,ANDY. YU,Convergence to Nash equilibrium and no-regret guarantee in (Markov) potential games, in Proceedings of The 27th International Conference on Artificial Intelligence and Statistics, S. Dasgupta, S. Mandt, and Y . Li, eds., vol. 238 of Proceedings of OPT...

    2024

  23. [31]

    DUMITRESCU, M

    R. DUMITRESCU, M. LEUTSCHER,ANDP. TANKOV,Control and optimal stopping Mean Field Games: a linear programming approach, Electronic Journal of Probability, 26 (2021), pp. 1 – 49

    2021

  24. [32]

    DUMITRESCU, ROXANA, LEUTSCHER, MARCOS,ANDTANKOV, PETER,Linear programming fictitious play algorithm for mean field games with optimal stopping and absorption, ESAIM: M2AN, 57 (2023), pp. 953–990

    2023

  25. [33]

    D. P. FOSTER ANDR. V. VOHRA,Calibrated learning and correlated equilibrium, Games and Economic Behavior, 21 (1997), pp. 40–55

    1997

  26. [34]

    FRIKHA, M

    N. FRIKHA, M. GERMAIN, M. LAURIERE, H. PHAM,ANDX. SONG,Actor-critic learning for mean-field control in continuous time, Journal of Machine Learning Research, 26 (2025), pp. 1–42

    2025

  27. [35]

    Z. GU ANDJ. ZHANG,On information controls, arXiv preprint arXiv:2602.07318, (2026)

    2026

  28. [36]

    X. GUO, A. HU,ANDJ. ZHANG,Mf-omo: An optimization formulation of mean-field games, SIAM Journal on Control and Optimization, 62 (2024), pp. 243–270

    2024

  29. [37]

    X. GUO, A. HU, J. ZHANG,ANDY. ZHANG,Continuous-time mean field games: a primal-dual characterization, arXiv preprint arXiv:2503.01042, (2025)

    2025

  30. [38]

    X. GUO, R. XU,ANDT. ZARIPHOPOULOU,Entropy regularization for mean field games with learning, Mathematics of Operations Research, 47 (2022), pp. 3239–3260

    2022

  31. [39]

    HADIKHANLOO,Learning in anonymous nonatomic games with applications to first-order mean field games, arXiv, (2017)

    S. HADIKHANLOO,Learning in anonymous nonatomic games with applications to first-order mean field games, arXiv, (2017)

    2017

  32. [40]

    HANNAN,Approximation to Bayes risk in repeated play, in Contributions to the theory of games, vol

    J. HANNAN,Approximation to Bayes risk in repeated play, in Contributions to the theory of games, vol. 3, Annals of Mathematics Studies, no. 39, Princeton University Press, Princeton, N.J., 1957, pp. 97–139

    1957

  33. [41]

    HART ANDA

    S. HART ANDA. MAS-COLELL,A simple adaptive procedure leading to correlated equilibrium, Econometrica, 68 (2000), pp. 1127–1150

    2000

  34. [42]

    U. G. HAUSSMANN ANDJ. P. LEPELTIER,On the existence of optimal controls, SIAM Journal on Control and Optimization, 28 (1990), pp. 851–902

    1990

  35. [43]

    A. HU ANDJ. ZHANG,Mf-oml: Online mean-field reinforcement learning with occupation measures for large population games, Applied Mathematics & Optimization, 92 (2025), pp. 1– 54

    2025

  36. [44]

    HUANG, R

    M. HUANG, R. P. MALHAM ´E,ANDP. E. CAINES,Large population stochastic dynamic games: Closed-loop mckean–vlasov systems and the nash certainty equivalence principle, Communica- tions in Information and Systems, 6 (2006), pp. 221–252

    2006

  37. [45]

    A. X. JIANG ANDK. LEYTON-BROWN,Polynomial-time computation of exact correlated equi- librium in compact games, Games Econom. Behav., 91 (2015), pp. 347–359

    2015

  38. [46]

    KURTZ,Martingale Problems for Conditional Distributions of Markov Processes, Electronic Journal of Probability, 3 (1998), pp

    T. KURTZ,Martingale Problems for Conditional Distributions of Markov Processes, Electronic Journal of Probability, 3 (1998), pp. 1 – 29

    1998

  39. [47]

    T. G. KURTZ ANDR. H. STOCKBRIDGE,Existence of markov controls and characterization of optimal markov controls, SIAM Journal on Control and Optimization, 36 (1998), pp. 609–653

    1998

  40. [48]

    T. G. KURTZ ANDR. H. STOCKBRIDGE,Linear programming formulations of singular sto- chastic control problems: Time-homogeneous problems, 2017

    2017

  41. [49]

    LACKER,Mean field games and interacting particle systems, Lecture notes, (2018)

    D. LACKER,Mean field games and interacting particle systems, Lecture notes, (2018)

    2018

  42. [50]

    LACKER,On the convergence of closed-loop nash equilibria to the mean field game limit, The Annals of Applied Probability, 30 (2020), pp

    D. LACKER,On the convergence of closed-loop nash equilibria to the mean field game limit, The Annals of Applied Probability, 30 (2020), pp. pp. 1693–1761

    2020

  43. [51]

    LACKER ANDL

    D. LACKER ANDL. LEFLEM,Closed-loop convergence for mean field games with common noise, Ann. Appl. Probab., 33 (2023), pp. 2681–2733

    2023

  44. [52]

    LASCU, M

    R.-A. LASCU, M. B. MAJKA,ANDŁ. SZPRUCH,Mirror descent-ascent for mean-field min- max problems, arXiv preprint arXiv:2402.08106, (2024). 54 CAMPI, CANNEROZZI, AND TZOUANAS

    2024 arXiv

  45. [53]

    LASRY ANDP.-L

    J.-M. LASRY ANDP.-L. LIONS,Mean field games, Japanese Journal of Mathematics, 2 (2007), pp. 229–260

    2007

  46. [54]

    M. LEUTSCHER DE LASNIEVES,Contributions to the linear programming approach for mean field games and its applications to electricity markets, theses, Institut Polytechnique de Paris, Dec. 2022

    2022

  47. [55]

    MAGNINO, K

    L. MAGNINO, K. SHAO, Z. WU, J. SHEN,ANDM. LAURIERE,Solving continuous mean field games: Deep reinforcement learning for non-stationary dynamics, in Advances in Neu- ral Information Processing Systems, D. Belgrave, C. Zhang, H. Lin, R. Pascanu, P. Koniusz, M. Ghassemi, and N. C...

    2025

  48. [56]

    MARRIS, I

    L. MARRIS, I. GEMP, T. ANTHONY, A. TACCHETTI, S. LIU,ANDK. TUYLS,Turbocharging solution concepts: Solving nes, ces and cces with neural equilibrium solvers, in Advances in Neural Information Processing Systems, S. Koyejo, S. Mohamed, A. Agarwal, D. Belgrave, K. Cho, and A. Oh,...

    2022

  49. [57]

    MARRIS, P

    L. MARRIS, P. MULLER, M. LANCTOT, K. TUYLS,ANDT. GRAEPEL,Multi-agent training beyond zero-sum with correlated equilibrium meta-solvers, in Proceedings of the 38th Interna- tional Conference on Machine Learning, M. Meila and T. Zhang, eds., vol. 139 of Proceedings of Machine Le...

    2021

  50. [58]

    MOULIN, I

    H. MOULIN, I. RAY,ANDS. SENGUPTA,Improving Nash by coarse correlation, J. Econom. Theory, 150 (2014), pp. 852–865

    2014

  51. [59]

    MOULIN ANDJ.-P

    H. MOULIN ANDJ.-P. VIAL,Strategically zero-sum games: the class of games whose com- pletely mixed equilibria cannot be improved upon, Internat. J. Game Theory, 7 (1978), pp. 201– 221

    1978

  52. [60]

    MULLER, R

    P. MULLER, R. ELIE, M. ROWLAND, M. LAURIERE, J. PEROLAT, S. PERRIN, M. GEIST, G. PILIOURAS, O. PIETQUIN,ANDK. TUYLS,Learning correlated equilibria in mean-field games, 2022

    2022

  53. [61]

    MULLER, M

    P. MULLER, M. ROWLAND, R. ELIE, G. PILIOURAS, J. PEROLAT, M. LAURIERE, R. MARINIER, O. PIETQUIN,ANDK. TUYLS,Learning equilibria in mean-field games: In- troducing mean-field psro, 2021

    2021

  54. [62]

    MULLER, M

    P. MULLER, M. ROWLAND, R. ELIE, G. PILIOURAS, J. PEROLAT, M. LAURIERE, R. MARINIER, O. PIETQUIN,ANDK. TUYLS,Learning equilibria in mean-field games: In- troducing mean-field psro, 2022

    2022

  55. [63]

    NEYMAN,Correlated equilibrium and potential games, International Journal of Game The- ory, 26 (1997), pp

    A. NEYMAN,Correlated equilibrium and potential games, International Journal of Game The- ory, 26 (1997), pp. 223–227

    1997

  56. [64]

    C. H. PAPADIMITRIOU ANDT. ROUGHGARDEN,Computing correlated equilibria in multi- player games, J. ACM, 55 (2008), pp. Art. 14, 29

    2008

  57. [65]

    PERRIN, J

    S. PERRIN, J. PEROLAT, M. LAURIERE, M. GEIST, R. ELIE,ANDO. PIETQUIN,Fictitious play for mean field games: Continuous time analysis and applications, in Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, eds., vol. ...

    2020

  58. [66]

    ROUGHGARDEN,Twenty lectures on algorithmic game theory, Cambridge University Press, Cambridge, 2016

    T. ROUGHGARDEN,Twenty lectures on algorithmic game theory, Cambridge University Press, Cambridge, 2016

    2016

  59. [67]

    SHALEV-SHWARTZ,Online learning and online convex optimization, Found

    S. SHALEV-SHWARTZ,Online learning and online convex optimization, Found. Trends Mach. Learn., 4 (2012), p. 107–194

    2012

  60. [68]

    SION,On general minimax theorems, Pacific Journal of Mathematics, 8 (1958), pp

    M. SION,On general minimax theorems, Pacific Journal of Mathematics, 8 (1958), pp. 171–176

    1958

  61. [69]

    THOMA, G

    V. THOMA, G. PILIOURAS,ANDL. MARRIS,Deep incentive design with differentiable equi- librium blocks, arXiv preprint arXiv:2603.07705, (2026)

    2026

  62. [70]

    A. J. VERETENNIKOV,Strong solutions and explicit formulas for solutions of stochastic integral equations, Mat. Sb. (N.S.), 111(153) (1980), pp. 434–452, 480

    1980

  63. [71]

    VILLANI,Optimal Transport: Old and New, Grundlehren der mathematischen Wis- senschaften, Springer Berlin Heidelberg, 2008

    C. VILLANI,Optimal Transport: Old and New, Grundlehren der mathematischen Wis- senschaften, Springer Berlin Heidelberg, 2008. OPTIMAL MEAN FIELD CCES 55

    2008

  64. [72]

    WARGA,Optimal control of differential and functional equations, Academic press, 2014

    J. WARGA,Optimal control of differential and functional equations, Academic press, 2014

    2014

  65. [73]

    B. H. ZHANG, G. FARINA, I. ANAGNOSTIDES, F. CACCIAMANI, S. MCALEER, A. HAUPT, A. CELLI, N. GATTI, V. CONITZER,ANDT. SANDHOLM,Computing optimal equilibria and mechanisms via learning in zero-sum extensive-form games, in Proceedings of the 37th Interna- tional Conference on Neur...

    2023

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.