Related papers: An Efficient Distributed Nash Equilibrium Seeking …
This paper considers a class of noncooperative games in which the feasible decision sets of all players are coupled together by a coupled inequality constraint. Adopting the variational inequality formulation of the game, we first introduce…
In this paper, we consider a distributed Bayesian Nash equilibrium (BNE) seeking problem in incomplete-information aggregative games, which is a generalization of Bayesian games and deterministic aggregative games. We handle the aggregation…
When the data are stored in a distributed manner, direct application of traditional statistical inference procedures is often prohibitive due to communication cost and privacy concerns. This paper develops and investigates two…
Demand response has been a promising solution for accommodating renewable energy in power systems. In this study, we consider a demand response scheme within a distribution network facing an energy supply deficit. The utility company…
The problem of the distributed Nash equilibrium seeking for aggregative games has been studied over strongly connected and weight-balanced static networks and every time strongly connected and weight-balanced switching networks. In this…
In this paper, we consider the problem of finding a Nash equilibrium in a multi-player game over generally connected networks. This model differs from a conventional setting in that players have partial information on the actions of their…
The multi-cluster games are addressed in this paper, where all players team up with the players in the cluster that they belong to, and compete against the players in other clusters to minimize the cost function of their own cluster. The…
Caching networks can reduce the routing costs of accessing contents by caching contents closer to users. However, cache nodes may belong to different entities and behave selfishly to maximize their own benefits, which often lead to…
We formulate the resource allocation problem for the uplink of code division multiple access (CDMA) networks using a game theoretic framework, propose an efficient and distributed algorithm for a joint rate and power allocation, and show…
This paper studies distributed Nash equilibrium (NE) seeking under Denial-of-Service (DoS) attacks and quantization. The players can only exchange information with their own direct neighbors. The transmitted information is subject to…
This paper mainly investigates a class of distributed Variational Generalized Nash Equilibrium (VGNE) seeking problems for both online noncooperative games and online aggregative games with time-varying coupling inequality constraints. Two…
In this paper, we aim to design a distributed approximate algorithm for seeking Nash equilibria of an aggregative game. Due to the local set constraints of each player, projectionbased algorithms have been widely employed for solving such…
This paper considers the design of fully distributed Nash equilibrium seeking strategies for multi-agent games. To develop fully distributed seeking strategies, two adaptive control laws, including a node-based control law and an edge-based…
Motivated by applications in job scheduling, queuing networks, and load balancing in cyber-physical systems, we develop and analyze a game-theoretic framework to balance the load among servers in static and dynamic settings. In these…
In this paper, we propose a novel class of Nash problems for Cognitive Radio (CR) networks, modeled as Gaussian frequency-selective interference channels, wherein each secondary user (SU) competes against the others to maximize his own…
In this paper, we consider a distributed learning problem in a subnetwork zero-sum game, where agents are competing in different subnetworks. These agents are connected through time-varying graphs where each agent has its own cost function…
We consider network aggregative games to model and study multi-agent populations in which each rational agent is influenced by the aggregate behavior of its neighbors, as specified by an underlying network. Specifically, we examine systems…
A fundamental open problem in monotone game theory is the computation of a specific generalized Nash equilibrium (GNE) among all the available ones, e.g. the optimal equilibrium with respect to a system-level objective. The existing GNE…
We consider the Nash equilibrium problem in a partial-decision information scenario. Specifically, each agent can only receive information from some neighbors via a communication network, while its cost function depends on the strategies of…
While in two-player zero-sum games the Nash equilibrium is a well-established prescriptive notion of optimal play, its applicability as a prescriptive tool beyond that setting is limited. Consequently, the study of decentralized learning…