English
Related papers

Related papers: Convergence for linear quadratic potential mean fi…

200 papers

Mean field game (MFG) systems consisting of a major agent and a large number of minor agents were introduced in (Huang, 2010) in an LQG setup. The Nash certainty equivalence was used to obtain a Markovian closed-loop Nash equilibrium for…

Optimization and Control · Mathematics 2022-10-19 Dena Firoozi

In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…

Computer Science and Game Theory · Computer Science 2020-06-18 Ben Amiet , Andrea Collevecchio , Marco Scarsini , Ziwen Zhong

This paper proposes and studies a class of discrete-time finite-time-horizon Stackelberg mean-field games, with one leader and an infinite number of identical and indistinguishable followers. In this game, the objective of the leader is to…

Optimization and Control · Mathematics 2022-10-11 Xin Guo , Anran Hu , Jiacheng Zhang

This paper studies social optima and Nash games for mean field linear quadratic control systems, where subsystems are coupled via dynamics and individual costs. For the social control problem, we first obtain a set of forward-backward…

Optimization and Control · Mathematics 2019-04-17 Bingchang Wang , Huanshui Zhang

One of the contributions of this work is to formulate the problem of energy-efficient power control in multiple access channels (namely, channels which comprise several transmitters and one receiver) as a stochastic differential game. The…

Networking and Internet Architecture · Computer Science 2013-05-14 François Mériaux , Samson Lasaulce , Hamidou Tembine

We consider a class of $N$-player games and mean-field games of singular controls with ergodic performance criterion, providing a benchmark case for irreversible investment games featuring mean-field interaction and strategic…

Optimization and Control · Mathematics 2025-04-30 Federico Cannerozzi , Giorgio Ferrari

We prove that in a normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium where each player randomizes uniformly among a set of O(log(m) + log(n)) pure strategies. This result induces an…

Computer Science and Game Theory · Computer Science 2013-07-19 Yakov Babichenko , Ron Peretz

We consider stochastic differential games with $N$ nearly identical players, linear-Gaussian dynamics, and infinite horizon discounted quadratic cost. Admissible controls are feedbacks for which the system is ergodic. We first study the…

Analysis of PDEs · Mathematics 2014-03-18 Fabio S. Priuli

This paper introduces a new method to achieve stable convergence to Nash equilibrium in duopoly noncooperative games. Inspired by the recent fixed-time Nash Equilibrium seeking (NES) as well as prescribed-time extremum seeking (ES) and…

Optimization and Control · Mathematics 2024-05-27 Victor Hugo Pereira Rodrigues , Tiago Roux Oliveira , Miroslav Krstić , Tamer Başar

First order kinetic mean field games formally describe the Nash equilibria of deterministic differential games where agents control their acceleration, asymptotically in the limit as the number of agents tends to infinity. The known results…

Analysis of PDEs · Mathematics 2022-07-12 Megan Griffin-Pickering , Alpár R. Mészáros

Mean field games (MFGs) model equilibria in games with a continuum of weakly interacting players as limiting systems of symmetric $n$-player games. We consider the finite-state, infinite-horizon problem with ergodic cost. Assuming Markovian…

Optimization and Control · Mathematics 2025-03-25 Asaf Cohen , Ethan Zell

The central result of classical game theory states that every finite normal form game has a Nash equilibrium, provided that players are allowed to use randomized (mixed) strategies. However, in practice, humans are known to be bad at…

Computer Science and Game Theory · Computer Science 2015-07-07 Pavel Hubáček , Moni Naor , Jonathan Ullman

We consider the problem of simultaneous learning in stochastic games with many players in the finite-horizon setting. While the typical target solution for a stochastic game is a Nash equilibrium, this is intractable with many players. We…

Computer Science and Game Theory · Computer Science 2022-10-27 William Brown

We consider the problem of computing Nash equilibria in potential games where each player's strategy set is subject to private uncoupled constraints. This scenario is frequently encountered in real-world applications like road network…

Computer Science and Game Theory · Computer Science 2024-02-13 Nikolas Patris , Stelios Stavroulakis , Fivos Kalogiannis , Rose Zhang , Ioannis Panageas

In this paper, we present a method for finding approximate Nash equilibria in a broad class of reachability games. These games are often used to formulate both collision avoidance and goal satisfaction. Our method is computationally…

Systems and Control · Electrical Eng. & Systems 2021-03-23 David Fridovich-Keil , Claire J. Tomlin

We study stationary mean field games with singular controls in which the representative player interacts with a long-time weighted average of the population through a discounted and an ergodic performance criterion. This class of games…

Optimization and Control · Mathematics 2025-09-23 Haoyang Cao , Jodi Dianetti , Giorgio Ferrari

We study optimal equilibria in multi-player games. An equilibrium is optimal for a player, if her payoff is maximal. A tempting approach to solving this problem is to seek optimal Nash equilibria, the standard form of equilibria where no…

Computer Science and Game Theory · Computer Science 2013-07-09 Anshul Gupta , Sven Schewe

In this article, we consider mean field games between a dominating player and a group of representative agents, each of which acts similarly and also interacts with each other through a mean field term being substantially influenced by the…

Optimization and Control · Mathematics 2014-07-28 Alain Bensoussan , Michael Chau , Phillip Yam

Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or continuous-time rule whereby the current mixed strategy profile…

Computer Science and Game Theory · Computer Science 2022-03-29 Jason Milionis , Christos Papadimitriou , Georgios Piliouras , Kelly Spendlove

In this short note we study a class of multi-player, turn-based games with deterministic state transitions and reachability / safety objectives (this class contains as special cases "classic" two-player reachability and safety games as well…

Computer Science and Game Theory · Computer Science 2018-10-05 Athanasios Kehagias