Distributed Nash equilibrium seeking in networked graphical games
From MaRDI portal
Publication:680484
DOI10.1016/J.AUTOMATICA.2017.09.016zbMATH Open1380.91036arXiv1703.09765OpenAlexW2604292427MaRDI QIDQ680484FDOQ680484
Lacra Pavel, Farzad Salehisadaghiani
Publication date: 23 January 2018
Published in: Automatica (Search for Journal in Brave)
Abstract: This paper considers a distributed gossip approach for finding a Nash equilibrium in networked games on graphs. In such games a player's cost function may be affected by the actions of any subset of players. An interference graph is employed to illustrate the partially-coupled cost functions and the asymmetric information requirements. For a given interference graph, network communication between players is considered to be limited. A generalized communication graph is designed so that players exchange only their required information. An algorithm is designed whereby players, with possibly partially-coupled cost functions, make decisions based on the estimates of other players' actions obtained from local neighbors. It is shown that this choice of communication graph guarantees that all players' information is exchanged after sufficiently many iterations. Using a set of standard assumptions on the cost functions, the interference and the communication graphs, almost sure convergence to a Nash equilibrium is proved for diminishing step sizes. Moreover, the case when the cost functions are not known by the players is investigated and a convergence proof is presented for diminishing step sizes. The effect of the second largest eigenvalue of the expected communication matrix on the convergence rate is quantified. The trade-off between parameters associated with the communication graph and the ones associated with the interference graph is illustrated. Numerical results are presented for a large-scale networked game.
Full work available at URL: https://arxiv.org/abs/1703.09765
Recommendations
- Nash equilibrium seeking with non-doubly stochastic communication weight matrix
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Adaptive approaches for fully distributed Nash equilibrium seeking in networked games
- Distributed Nash equilibrium seeking under quantization communication
Cites Work
- Algorithmic Game Theory
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Distributed Subgradient Methods for Multi-Agent Optimization
- Title not available (Why is that?)
- Distributed Nash equilibrium seeking: a gossip-based algorithm
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Game theory for control of optical networks.
- Optimal Pricing in Networks with Externalities
- Multi-agent discrete-time graphical games and reinforcement learning solutions
- A note on maximal triangle‐free graphs
- Distributed robust adaptive equilibrium computation for generalized convex games
Cited In (16)
- Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game
- An operator splitting approach for distributed generalized Nash equilibria computation
- Distributed Nash equilibrium seeking under partial-decision information via the alternating direction method of multipliers
- Linear quadratic network games with dynamic players: stabilization and output convergence to Nash equilibrium
- Distributed adaptive Nash equilibrium seeking and disturbance rejection for noncooperative games of high‐order nonlinear systems with input saturation and input delay
- On Distributed Generalized Nash Equilibrium Seeking
- Differentially private distributed algorithms for stochastic aggregative games
- Distributed aggregative games on graphs in adversarial environments
- Robust Distributed Nash Equilibrium Seeking for Games Under Attacks and Communication Delays
- Distributed Nash equilibrium seeking for networked games of multiple high-order systems with disturbance rejection and communication delay
- An algorithm for finding Nash equilibria in dynamic network games
- Computing Nash Equilibria in Multiplayer DAG-Structured Stochastic Games with Persistent Imperfect Information
- Distributed averaging integral Nash equilibrium seeking on networks
- Online Distributed Algorithms for Seeking Generalized Nash Equilibria in Dynamic Environments
- Title not available (Why is that?)
- Distributed Nash equilibrium seeking on compact action sets over jointly strongly connected switching networks
This page was built for publication: Distributed Nash equilibrium seeking in networked graphical games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680484)
