On the efficiency of equilibria in mean-field oscillator games
From MaRDI portal
Publication:2514576
DOI10.1007/s13235-013-0100-0zbMath1314.91024OpenAlexW2115920495MaRDI QIDQ2514576
Huibing Yin, Prashant G. Mehta, Uday V. Shanbhag, Sean P. Meyn
Publication date: 3 February 2015
Published in: Dynamic Games and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13235-013-0100-0
Noncooperative games (91A10) Games with infinitely many players (91A07) Stochastic games, stochastic differential games (91A15)
Related Items (6)
Nonlinear network dynamics for interconnected micro-grids ⋮ Jet lag recovery: synchronization of circadian oscillators as a mean field game ⋮ Consensus via multi-population robust mean-field games ⋮ Polarization and coherence in mean field games driven by private and social utility ⋮ First-order, stationary mean-field games with congestion ⋮ Connections between mean-field game and social welfare optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Mean field games
- Predator mutualists in patchy space with diffusion
- Large population stochastic dynamic games: closed-loop McKean-Vlasov systems and the Nash certainty equivalence principle
- Efficient and fair routing for mesh networks
- How bad is selfish routing?
- Efficiency and fairness of system-optimal routing with user constraints
- Efficiency loss in a network resource allocation game: the case of elastic supply
- Large-Population Cost-Coupled LQG Problems With Nonuniform Agents: Individual-Mass Behavior and Decentralized $\varepsilon$-Nash Equilibria
- System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
- Synchronization of Coupled Oscillators is a Game
- Social Optima in Mean Field LQG Control: Centralized and Decentralized Strategies
- Competition and Efficiency in Congested Markets
- Nash Equilibria for Large-Population Linear Stochastic Systems of Weakly Coupled Agents
- Control Techniques for Complex Networks
- Efficiency Loss in a Network Resource Allocation Game
- Selfish Routing in Capacitated Networks
- Integer Programming and Combinatorial Optimization
- The price of anarchy is independent of the network topology
This page was built for publication: On the efficiency of equilibria in mean-field oscillator games
