Recent advances in optimization and game theoretic control for networked systems
The aim of this paper is to provide an overview, although unnecessarily complete, of recent
advances in optimal control, optimization, and game theory for networked systems. First, the …
advances in optimal control, optimization, and game theory for networked systems. First, the …
A passivity-based approach to Nash equilibrium seeking over networks
In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over
networks, a setting in which players have limited local information on the others' decisions …
networks, a setting in which players have limited local information on the others' decisions …
Designing games for distributed optimization
The central goal in multiagent systems is to design local control laws for the individual
agents to ensure that the emergent global behavior is desirable with respect to a given …
agents to ensure that the emergent global behavior is desirable with respect to a given …
Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
JS Shamma, G Arslan - IEEE Transactions on Automatic …, 2005 - ieeexplore.ieee.org
We consider a continuous-time form of repeated matrix games in which player strategies
evolve in reaction to opponent actions. Players observe each other's actions, but do not …
evolve in reaction to opponent actions. Players observe each other's actions, but do not …
Dynamic NE seeking for multi-integrator networked agents with disturbance rejection
AR Romano, L Pavel - IEEE Transactions on Control of …, 2019 - ieeexplore.ieee.org
In this paper, we consider game problems played by (multi)-integrator agents, subject to
external disturbances. We propose Nash equilibrium seeking dynamics based on gradient …
external disturbances. We propose Nash equilibrium seeking dynamics based on gradient …
Distributed Nash equilibrium seeking over strongly connected switching networks
The Nash equilibrium seeking over networks of N players has been studied under the
assumption that the network is static and strongly connected or switching and every time …
assumption that the network is static and strongly connected or switching and every time …
Distributed learning for stochastic generalized Nash equilibrium problems
CK Yu, M Van Der Schaar… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
This paper examines a stochastic formulation of the generalized Nash equilibrium problem
where agents are subject to randomness in the environment of unknown statistical …
where agents are subject to randomness in the environment of unknown statistical …
Distributed Nash equilibrium seeking with dynamics subject to disturbance of unknown frequencies over jointly strongly connected switching networks
In this article, we study the problem of distributed Nash equilibrium seeking of-player games
with single-integrator dynamics subject to disturbances generated by an uncertain …
with single-integrator dynamics subject to disturbances generated by an uncertain …
Random access game and medium access control design
Motivated partially by a control-theoretic viewpoint, we propose a game-theoretic model,
called random access game, for contention control. We characterize Nash equilibria of …
called random access game, for contention control. We characterize Nash equilibria of …
Distributed Nash equilibrium seeking and disturbance rejection for high-order integrators over jointly strongly connected switching networks
In this article, we study the problem of Nash equilibrium (NE) seeking of-player games with
high-order integrator agents over jointly strongly connected networks. The same problem …
high-order integrator agents over jointly strongly connected networks. The same problem …