Distributed Nash equilibrium seeking in games with partial decision information: A survey
M Ye, QL Han, L Ding, S Xu - Proceedings of the IEEE, 2023 - ieeexplore.ieee.org
Nash equilibrium, as an essential strategic profile in game theory, is of both practical
relevance and theoretical significance due to its wide penetration into various fields, such as …
relevance and theoretical significance due to its wide penetration into various fields, such as …
Analysis and interventions in large network games
We review classic results and recent progress on equilibrium analysis, dynamics, and
optimal interventions in network games with both continuous and discrete strategy sets. We …
optimal interventions in network games with both continuous and discrete strategy sets. We …
Online distributed algorithms for online noncooperative games with stochastic cost functions: high probability bound of regrets
K Lu - IEEE Transactions on Automatic Control, 2024 - ieeexplore.ieee.org
In this article, online noncooperative games without full decision information are studied,
where the goal of players is to seek the Nash equilibria in a distributed manner. Different …
where the goal of players is to seek the Nash equilibria in a distributed manner. Different …
Operationally-safe peer-to-peer energy trading in distribution grids: A game-theoretic market-clearing mechanism
In future distribution grids, prosumers (ie, energy consumers with storage and/or production
capabilities) will trade energy with each other and with the main grid. To ensure an efficient …
capabilities) will trade energy with each other and with the main grid. To ensure an efficient …
Fixed point strategies in data science
The goal of this article is to promote the use of fixed point strategies in data science by
showing that they provide a simplifying and unifying framework to model, analyze, and solve …
showing that they provide a simplifying and unifying framework to model, analyze, and solve …
[HTML][HTML] Fast generalized Nash equilibrium seeking under partial-decision information
We address the generalized Nash equilibrium seeking problem in a partial-decision
information scenario, where each agent can only exchange information with some …
information scenario, where each agent can only exchange information with some …
The geometry of monotone operator splitting methods
PL Combettes - Acta Numerica, 2024 - cambridge.org
We propose a geometric framework to describe and analyse a wide array of operator
splitting methods for solving monotone inclusion problems. The initial inclusion problem …
splitting methods for solving monotone inclusion problems. The initial inclusion problem …
Distributed online aggregative optimization for dynamic multirobot coordination
This article focuses on an online version of the emerging distributed constrained
aggregative optimization framework, which is particularly suited for applications arising in …
aggregative optimization framework, which is particularly suited for applications arising in …
Distributed generalized Nash equilibrium seeking: An operator-theoretic perspective
Generalized games model interactions between a set of selfish decision makers, called
players or agents, where both the objective function and the feasible decision set of each …
players or agents, where both the objective function and the feasible decision set of each …
Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate
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 …