Nash equilibrium seeking for N-coalition noncooperative games
An N-coalition noncooperative game is formulated in this paper. In the formulated game,
there are N interacting coalitions and each of them includes a set of agents. Each coalition …
there are N interacting coalitions and each of them includes a set of agents. Each coalition …
[图书][B] Stochastic averaging and stochastic extremum seeking
SJ Liu, M Krstic - 2012 - books.google.com
Stochastic Averaging and Extremum Seeking treats methods inspired by attempts to
understand the seemingly non-mathematical question of bacterial chemotaxis and their …
understand the seemingly non-mathematical question of bacterial chemotaxis and their …
State based potential games
JR Marden - Automatica, 2012 - Elsevier
There is a growing interest in the application of game theoretic methods to the design and
control of multiagent systems. However, the existing game theoretic framework possesses …
control of multiagent systems. However, the existing game theoretic framework possesses …
[PDF][PDF] Is multiagent deep reinforcement learning the answer or the question? A brief survey
Deep reinforcement learning (RL) has achieved outstanding results in recent years. This has
led to a dramatic increase in the number of applications and methods. Recent works have …
led to a dramatic increase in the number of applications and methods. Recent works have …
Regularized iterative stochastic approximation methods for stochastic variational inequality problems
J Koshal, A Nedic, UV Shanbhag - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
We consider a Cartesian stochastic variational inequality problem with a monotone map.
Monotone stochastic variational inequalities arise naturally, for instance, as the equilibrium …
Monotone stochastic variational inequalities arise naturally, for instance, as the equilibrium …
Gradient play in stochastic games: stationary points, convergence, and sample complexity
We study the performance of the gradient play algorithm for stochastic games (SGs), where
each agent tries to maximize its own total discounted reward by making decisions …
each agent tries to maximize its own total discounted reward by making decisions …
Distributed model predictive control of an experimental four-tank system
M Mercangöz, FJ Doyle III - Journal of process control, 2007 - Elsevier
A distributed model predictive control (DMPC) framework is proposed. The physical plant
structure and the plant mathematical model are used to partition the system into self …
structure and the plant mathematical model are used to partition the system into self …
Jamming games in wireless networks with incomplete information
YE Sagduyu, RA Berry… - IEEE Communications …, 2011 - ieeexplore.ieee.org
Due to their broadcast nature, wireless networks are highly susceptible to jamming attacks
resulting in denial of service. Game theory provides powerful tools to model and analyze …
resulting in denial of service. Game theory provides powerful tools to model and analyze …
Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate
M Bianchi, S Grammatico - IEEE Control Systems Letters, 2020 - ieeexplore.ieee.org
We design a distributed algorithm for learning Nash equilibria over time-varying
communication networks in a partial-decision information scenario, where each agent can …
communication networks in a partial-decision information scenario, where each agent can …
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 …