Linear-Quadratic NN-person and Mean-Field Games with Ergodic Cost

We consider stochastic differential games with $N$ players, linear-Gaussian dynamics in arbitrary state-space dimension, and long-time-average cost with quadratic running cost. Admissible controls are feedbacks for which the system is ergodic. We first study the existence of affine Nash equilibria by means of an associated system of $N$ Hamilton-Jacobi-Bellman and $N$ Kolmogorov-Fokker-Planck partial differential equations. We give necessary and sufficient conditions for the existence and uniqueness of quadratic-Gaussian solutions in terms of the solvability of suitable algebraic Riccati and Sylvester equations. Under a symmetry condition on the running costs and for nearly identical players we study the large population limit, $N$ tending to infinity, and find a unique quadratic-Gaussian solution of the pair of Mean Field Game HJB-KFP equations. Examples of explicit solutions are given, in particular for consensus problems.Comment: 31 page

Mean Field Games models of segregation

This paper introduces and analyses some models in the framework of Mean Field Games describing interactions between two populations motivated by the studies on urban settlements and residential choice by Thomas Schelling. For static games, a large population limit is proved. For differential games with noise, the existence of solutions is established for the systems of partial differential equations of Mean Field Game theory, in the stationary and in the evolutive case. Numerical methods are proposed, with several simulations. In the examples and in the numerical results, particular emphasis is put on the phenomenon of segregation between the populations.Comment: 35 pages, 10 figure

Mean field games models of segregation

This paper introduces and analyzes some models in the framework of mean field games (MFGs) describing interactions between two populations motivated by the studies on urban settlements and residential choice by Thomas Schelling. For static games, a large population limit is proved. For differential games with noise, the existence of solutions is established for the systems of partial differential equations of MFG theory, in the stationary and in the evolutive case. Numerical methods are proposed with several simulations. In the examples and in the numerical results, particular emphasis is put on the phenomenon of segregation between the populations. </jats:p

Controlled diffusion processes

This article gives an overview of the developments in controlled diffusion processes, emphasizing key results regarding existence of optimal controls and their characterization via dynamic programming for a variety of cost criteria and structural assumptions. Stochastic maximum principle and control under partial observations (equivalently, control of nonlinear filters) are also discussed. Several other related topics are briefly sketched.Comment: Published at http://dx.doi.org/10.1214/154957805100000131 in the Probability Surveys (http://www.i-journals.org/ps/) by the Institute of Mathematical Statistics (http://www.imstat.org

Distributed Learning Policies for Power Allocation in Multiple Access Channels

We analyze the problem of distributed power allocation for orthogonal multiple access channels by considering a continuous non-cooperative game whose strategy space represents the users' distribution of transmission power over the network's channels. When the channels are static, we find that this game admits an exact potential function and this allows us to show that it has a unique equilibrium almost surely. Furthermore, using the game's potential property, we derive a modified version of the replicator dynamics of evolutionary game theory which applies to this continuous game, and we show that if the network's users employ a distributed learning scheme based on these dynamics, then they converge to equilibrium exponentially quickly. On the other hand, a major challenge occurs if the channels do not remain static but fluctuate stochastically over time, following a stationary ergodic process. In that case, the associated ergodic game still admits a unique equilibrium, but the learning analysis becomes much more complicated because the replicator dynamics are no longer deterministic. Nonetheless, by employing results from the theory of stochastic approximation, we show that users still converge to the game's unique equilibrium. Our analysis hinges on a game-theoretical result which is of independent interest: in finite player games which admit a (possibly nonlinear) convex potential function, the replicator dynamics (suitably modified to account for nonlinear payoffs) converge to an eps-neighborhood of an equilibrium at time of order O(log(1/eps)).Comment: 11 pages, 8 figures. Revised manuscript structure and added more material and figures for the case of stochastically fluctuating channels. This version will appear in the IEEE Journal on Selected Areas in Communication, Special Issue on Game Theory in Wireless Communication