Open Access
| Issue |
ESAIM: COCV
Volume 32, 2026
|
|
|---|---|---|
| Article Number | 45 | |
| Number of page(s) | 45 | |
| DOI | https://doi.org/10.1051/cocv/2026026 | |
| Published online | 25 May 2026 | |
- P. Cannarsa and R. Capuani, Existence and uniqueness for mean field games with state constraints. PDE Models Multi-agent Phenomena (2018) 49–71. [Google Scholar]
- M.-W. Cheung and R. Lahkar, Nonatomic potential games: the continuous strategy case. Games Econ. Behav. 108 (2018) 341–362. [Google Scholar]
- F. Santambrogio and W. Shim, A Cucker-Smale inspired deterministic mean field game with velocity interactions. SIAM J. Control Optim. 59 (2021) 4155–4187. [Google Scholar]
- J.-D. Benamou, G. Carlier and F. Santambrogio, Variational mean field games. Active Particles, Vol. 1 of Advances in Theory, Models, and Applications (2017) 141–171. [Google Scholar]
- J.F. Bonnans, J. Gianatti and L. Pfeiffer, A lagrangian approach for aggregative mean field games of controls with mixed and final constraints. SIAM J. Control Optim. 61 (2023) 105–134. [Google Scholar]
- C. Sarrazin, Lagrangian discretization of variational mean field games. SIAM J. Control Optim. 60 (2022) 1365–1392. [CrossRef] [MathSciNet] [Google Scholar]
- O. Beaude, P. Benchimol, S. Gaubert, P. Jacquot and N. Oudjane, A privacy-preserving method to optimize distributed resource allocation. SIAM J. Optim. 30 (2020) 2303–2336. [Google Scholar]
- P. Jacquot, O. Beaude, S. Gaubert and N. Oudjane, Analysis and implementation of an hourly billing mechanism for demand response management. IEEE Trans. Smart Grid 10 (2018) 4265–4278. [Google Scholar]
- K. Liu, N. Oudjane and L. Pfeiffer, Decomposed resolution of finite-state aggregative optimal control problems, in 2023 Proceedings of the Conference on Control and its Applications (CT). SIAM (2023) 56–63. [Google Scholar]
- L. Chizat and F. Bach, On the global convergence of gradient descent for over-parameterized models using optimal transport. Adv. Neural Inform. Process. Syst. 31 (2018) 3036–3046. [Google Scholar]
- K. Liu and E. Zuazua, Representation and regression problems in neural networks: Relaxation, generalization, and numerics. Math. Models Methods Appl. Sci. 35 (2025) 1471–1521. [Google Scholar]
- S. Mei, A. Montanari and P.-M. Nguyen, A mean field view of the landscape of two-layer neural networks. Proc. Natl. Acad. Sci. U.S.A. 115 (2018) E7665–E7671. [Google Scholar]
- N. Boyd, G. Schiebinger and B. Recht, The alternating descent conditional gradient method for sparse inverse problems. SIAM J. Optim. 27 (2017) 616–639. [CrossRef] [MathSciNet] [Google Scholar]
- M. Wang, Vanishing price of decentralization in large coordinative nonconvex optimization. SIAM J. Optim. 27 (2017) 1977–2009. [Google Scholar]
- Q. Merigot and J.-M. Mirebeau, Minimal geodesics along volume-preserving maps, through semidiscrete optima transport. SIAM J. Numer. Anal. 54 (2016) 3465–3492. [CrossRef] [MathSciNet] [Google Scholar]
- Bonnans, K. Liu, N. Oudjane, L. Pfeiffer and C. Wan, Large-scale nonconvex optimization: randomization, gap estimation, and numerical resolution. SIAM J. Optim. 33 (2023) 3083–3113. [Google Scholar]
- M. Geist, J. Perolat, M. Lauriere, R. Elie, S. Perrin, O. Bachem, R. Munos and O. Pietquin, Concave utility reinforcement learning: The mean-field game viewpoint, in Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (2022) 489–497. [Google Scholar]
- P. Lavigne and L. Pfeiffer, Generalized conditional gradient and learning in potential mean field games. Appl. Math. Optim. 89 (2023) Article no 89. [Google Scholar]
- K. Liu and L. Pfeiffer, A mesh-independent method for second-order potential mean field games. IMA J. Numer. Anal. 45 (2025) 1226–1266. [Google Scholar]
- P. Cardaliaguet and S. Hadikhanloo, Learning in mean field games: the fictitious play. ESAIM: Control Optim. Calc. Var. 23 (2017) 569–591. [Google Scholar]
- S. Hadikhanloo and F.J. Silva, Finite mean field games: fictitious play and convergence to a first order continuous mean field game. J. Math. Pures Appl. 132 (2019) 369–397. [CrossRef] [MathSciNet] [Google Scholar]
- Y. Brenier, Decomposition polaire et rearrangement monotone des champs de vecteurs. CR Acad. Sci. Paris Ser. I Math. 305 (1987) 805–808. [Google Scholar]
- P. Graewe, U. Horst and R. Sircar, A maximum principle approach to a deterministic mean field game of control with absorption. SIAM J. Control Optim. 60 (2022) 3173–3190. [Google Scholar]
- W. Rudin, Real and Complex Analysis, vol. 3. McGraw-Hill (1987). [Google Scholar]
- J.-P. Aubin and Hélène Frankowska, Set-valued Analysis. Springer Science & Business Media (2009). [Google Scholar]
- R.J. Aumann, Measurable utility and the measurable choice problem, in La Decision. Colloque Internationaux du C.N.R.S., Paris (1969) 15–26. [Google Scholar]
- D.L. Cohn, Measure Theory, vol. 1. Springer (2013). [Google Scholar]
- L. Ambrosio, N. Gigli and G. Savare, Gradient Flows: In Metric Spaces and in the Space of Probability Measures. Springer Science & Business Media (2005). [Google Scholar]
- Y. Nesterov, Lectures on Convex Optimization, vol. 137. Springer (2018). [Google Scholar]
- M. Jaggi, Revisiting Frank-Wolfe: Projection-free sparse convex optimization, in International Conference on Machine Learning. PMLR (2013) 427–435. [Google Scholar]
- K. Bredies, M. Carioni, S. Fanzon and D. Walter, Asymptotic linear convergence of fully-corrective generalized conditional gradient methods. Math. Program. 205 (2024) 135–202. [Google Scholar]
- K. Bredies and H.K. Pikkarainen, Inverse problems in spaces of measures. ESAIM: Control Optim. Calc. Var. 19 (2013) 190–218. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
- K. Pieper and D. Walter, Linear convergence of accelerated conditional gradient algorithms in spaces of measures. ESAIM: Control Optim. Calc. Var. 27 (2021) 38. [Google Scholar]
- K. Bredies, D.A Lorenz and P. Maass, A generalized conditional gradient method and its connection to an iterative shrinkage method. Computat. Optim. Appl. 42 (2009) 173–193. [Google Scholar]
- C. Villani, Optimal Transport: Old and New, vol. 338. Springer (2009). [Google Scholar]
- C. Ma, L. Wu, and W. E, The Barron space and the flow-induced function spaces for neural network models. Construct. Approx. 55 (2022) 369–406. [Google Scholar]
- A.R. Barron, Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory 39 (1993) 930–945. [Google Scholar]
- G. Pisier, Remarques sur un résultat non publie de B. Maurey. Séminaire d'Analyse fonctionnelle (Ecole Polytechnique) (1981) 1–12. [Google Scholar]
- G.B. Folland, Real Analysis: Modern Techniques and their Applications, vol. 40. John Wiley & Sons (1999). [Google Scholar]
- H.H. Bauschke and P.L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, vol. 408. Springer (2011). [Google Scholar]
- R.T. Rockafellar, Convex Analysis, vol. 11. Princeton University Press (1997). [Google Scholar]
- A. Gersho and R.M. Gray, Vector Quantization and Signal Compression, vol. 159. Springer Science & Business Media (2012). [Google Scholar]
- K. Falconer, Fractal Geometry: Mathematical Foundations and Applications. John Wiley & Sons (2004). [Google Scholar]
- J. Kitagawa, Q. Merigot and B. Thibert, Convergence of a newton algorithm for semi-discrete optimal transport. J. Eur. Math. Soc. 21 (2019) 2603–2651. [CrossRef] [MathSciNet] [Google Scholar]
- B. Lévy, A numerical algorithm for l2 semi-discrete optimal transport in 3d. ESAIM: Math. Model. Numer. Anal. 49 (2015) 1693–1715. [Google Scholar]
- N. Fournier and A. Guillin, On the rate of convergence in wasserstein distance of the empirical measure. Probab. Theory Related Fields 162 (2015) 707–738. [Google Scholar]
- Q. Mérigot, A multiscale approach to optimal transport. Comput. Graph. Forum 30 (2011) 1583–1592. [Google Scholar]
- Y. Sheffi, Urban Transportation Networks, vol. 6. Prentice-Hall, Englewood Cliffs, NJ (1985). [Google Scholar]
- H. Brézis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, vol. 2. Springer (2011). [Google Scholar]
- LLC Gurobi Optimization, Gurobi optimizer reference manual (2018). [Google Scholar]
- P. Virtanen, R. Gommers, T.E. Oliphant, M. Haberland, T. Reddy, D. Cournapeau, E. Burovski, P. Peterson, W. Weckesser, J. Bright, et al. Scipy 1.0: fundamental algorithms for scientific computing in python. Nat. Methods 17 (2020) 261–272. [NASA ADS] [CrossRef] [Google Scholar]
- H. Tong, Some characterizations of normal and perfectly normal spaces. Duke Math. J. 19 (1952) 289–292. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.
