相关论文: Splitting methods for a class of non-potential mea…

As the earliest and one of the most fundamental learning dynamics for computing NE, fictitious play (FP) has being receiving incessant research attention and finding games where FP would converge (games with FPP) is one central question in…

We study a Mean Field Games (MFG) system in a real, separable infinite dimensional Hilbert space. The system consists of a second order parabolic type equation, called Hamilton-Jacobi-Bellman (HJB) equation in the paper, coupled with a…

We present a method enabling a large number of agents to learn how to flock, which is a natural behavior observed in large populations of animals. This problem has drawn a lot of interest but requires many structural assumptions and is…

Non-local games (NLGs) provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product…

We propose a primal-dual smoothing framework for finding a near-stationary point of a class of non-smooth non-convex optimization problems with max-structure. We analyze the primal and dual gradient complexities of the framework via two…

We introduce two Smoothed Policy Iteration algorithms (\textbf{SPI}s) as rules for learning policies and methods for computing Nash equilibria in second order potential Mean Field Games (MFGs). Global convergence is proved if the coupling…

We study the existence of strong solutions for mean-field forward-backward stochastic differential equations (FBSDEs) with measurable coefficients and their implication on the Nash equilibrium of a multi-population mean-field game. More…

The Primal-Dual Hybrid Gradient (PDHG) algorithm is a first-order method that can exploit GPUs to solve large-scale linear programming problems. The approach can often be faster than the alternatives, simplex and interior-point methods,…

Mean Field Games (MFG) provide a theoretical frame to model socio-economic systems. In this letter, we study a particular class of MFG which shows strong analogies with the {\em non-linear Schr\"odinger and Gross-Pitaevski equations}…

In this paper, we consider a class of structured nonsmooth optimization problems over an embedded submanifold of a Euclidean space, where the first part of the objective is the sum of a difference-of-convex (DC) function and a smooth…

In this work we develop a numerical method for solving a type of convex graph-structured tensor optimization problems. This type of problems, which can be seen as a generalization of multi-marginal optimal transport problems with…

Mean-field games with absorption is a class of games, that have been introduced in Campi and Fischer (2018) and that can be viewed as natural limits of symmetric stochastic differential games with a large number of players who, interacting…

We establish the convergence of the deep actor-critic reinforcement learning algorithm presented in [Angiuli et al., 2023a] in the setting of continuous state and action spaces with an infinite discrete-time horizon. This algorithm provides…

Recently, the paper [12] introduces a derivative-free consensus-based particle method that finds the Nash equilibrium of non-convex multiplayer games, where it proves the global exponential convergence in the sense of mean-field law. This…

In this work we propose a new splitting technique, namely Asymmetric Forward-Backward-Adjoint splitting, for solving monotone inclusions involving three terms, a maximally monotone, a cocoercive and a bounded linear operator. Classical…

This contribution is dedicated to the exploration of exponential operator splitting methods for the time integration of evolution equations. It entails the review of previous achievements as well as the depiction of novel results. The…

Mean-Field Game (MFG) serves as a crucial mathematical framework in modeling the collective behavior of individual agents interacting stochastically with a large population. In this work, we aim at solving a challenging class of MFGs in…

This paper studies the distributed optimization problem when the objective functions might be nondifferentiable and subject to heterogeneous set constraints. Unlike existing subgradient methods, we focus on the case when the exact…

In this paper we propose a high-order numerical scheme for time-dependent mean field games systems. The scheme, which is built by combining Lagrange-Galerkin and semi-Lagrangian techniques, is consistent and stable for large time steps…

We propose a single-level numerical approach to solve Stackelberg mean field game (MFG) problems. In Stackelberg MFG, an infinite population of agents play a non-cooperative game and choose their controls to optimize their individual…