相关论文: Attack-Resilient Distributed Algorithms for Expone…
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…
Current research in distributed Nash equilibrium (NE) seeking in the partial information setting assumes that information is exchanged between agents that are "truthful". However, in general noncooperative games agents may consider sending…
This paper considers the problem of Nash equilibrium (NE) seeking in aggregative games, where the payoff function of each player depends on an aggregate of all players' actions. We present a distributed continuous time algorithm such that…
This paper addresses a resilient exponential distributed convex optimization problem for a heterogeneous linear multi-agent system under Denial-of-Service (DoS) attacks over random digraphs. The random digraphs are caused by unreliable…
This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play,…
In this paper, we address the challenge of Nash equilibrium (NE) seeking in non-cooperative convex games with partial-decision information. We propose a distributed algorithm, where each agent refines its strategy through projected-gradient…
Distributed Nash equilibrium (NE) seeking problem for multi-coalition games has attracted increasing attention in recent years, but the research mainly focuses on the case without agreement demand within coalitions. This paper considers a…
Distributed Nash equilibrium (NE) seeking problems for networked games have been widely investigated in recent years. Despite the increasing attention, communication expenditure is becoming a major bottleneck for scaling up distributed…
Information compression techniques are majorly employed to address the concern of reducing communication cost over peer-to-peer links. In this paper, we investigate distributed Nash equilibrium (NE) seeking problems in a class of…
In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking where a network of players, abstracted as a directed graph, aim to minimize their own local cost functions non-cooperatively. Considering the…
Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is proposed. The algorithm is designed by virtue of projected gradient play dynamics and distributed average tracking dynamics, and is…
Distributed optimization and Nash equilibrium (NE) seeking problems have drawn much attention in the control community recently. This paper studies a class of non-cooperative games, known as N-cluster game, which subsumes both cooperative…
This paper investigates a distributed robust Nash Equilibrium (NE) seeking problem for second-order players subject to external disturbances and uncertain dynamics while communicating via semi-Markov switching topologies. To accommodate the…
This paper considers the distributed strategy design for Nash equilibrium (NE) seeking in multi-cluster games under a partial-decision information scenario. In the considered game, there are multiple clusters and each cluster consists of a…
This paper studies the distributed generalized Nash equilibrium seeking problem for aggregative games with coupling constraints, where each player optimizes its strategy depending on its local cost function and the estimated strategy…
The property of the communication network and the constraints on the strategic space are two factors that determine the complexity of the distributed Nash equilibrium (DNE) seeking problem. The DNE seeking problem of aggregative games has…
We consider the joint design of control and scheduling under stochastic Denial-of-Service (DoS) attacks in the context of networked control systems. A sensor takes measurements of the system output and forwards its dynamic state estimates…
This paper addresses the distributed Nash Equilibrium seeking problem for aggregative games, where legitimate players' decisions are affected by potential malicious players. To describe players' behavior, we introduce a novel heterogeneous…
In this paper, we investigate the seeking of Nash equilibrium (NE) in a non-cooperative quadratic game where all agents exchange their delayed strategy information with their neighbors. To extend best-response algorithms to the delayed…
In this paper, we investigate a prescribed-time and fully distributed Nash Equilibrium (NE) seeking problem for continuous-time noncooperative games. By exploiting pseudo-gradient play and consensus-based schemes, various distributed NE…