paper-with-me

Papers

Quantized distributed Nash equilibrium seeking under DoS attacks

2023-08-24 · Shuai Feng, Maojiao Ye, Lihua Xie, Shengyuan Xu

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 quantization and packet losses induced by malicious DoS attacks. We propose a quantized distributed NE seeking strategy based on the approach of dynamic quantized consensus. To solve the quantizer saturation problem caused by DoS attacks, the quantization mechanism is equipped to have zooming-in and holding capabilities, in which the holding capability is consistent with the results in quantized consensus under DoS. A sufficient condition on the number of quantizer levels is provided, under which the quantizers are free from saturation under DoS attacks. The proposed distributed quantized NE seeking strategy is shown to have the so-called maximum resilience to DoS attacks. Namely, if the bound characterizing the maximum resilience is violated, an attacker can deny all the transmissions and hence distributed NE seeking is impossible.

📄 PDF Abstract BibTeX arXiv:2308.12617

Code (0)

등록된 구현이 없습니다.

Tasks

Quantization

Similar Papers 제목 키워드 기반

Distributed Nash Equilibrium Seeking Algorithm in Aggregative Games for Heterogeneous Multi-Robot Systems

2025-09-19 · Yi Dong, Zhongguo Li, Sarvapali D. Ramchurn, Xiaowei Huang arxiv

This paper develops a distributed Nash Equilibrium seeking algorithm for heterogeneous multi-robot systems. The algorithm utilises distributed optimisation and output control to achieve the Nash equilibrium by leveraging…

Tracking-based distributed equilibrium seeking for aggregative games

2022-10-26 · Guido Carnevale, Filippo Fabiani, Filiberto Fele, Kostas Margellos 외

We propose fully-distributed algorithms for Nash equilibrium seeking in aggregative games over networks. We first consider the case where local constraints are present and we design an algorithm combining, for each agent…

Distributed Nash Equilibrium Seeking for Noncooperative Games of High-Order Nonlinear Multi-Agent Systems Over Weight-Unbalanced Digraphs

2021-12-16 · Zhenhua Deng, Jin Luo

In this paper, we investigate the noncooperative games of multi-agent systems. Different from existing noncooperative games, our formulation involves the high-order nonlinear dynamics of players, and the communication to…

Generalized uncertain Nash games: Reformulation and robust equilibrium seeking -- Extended version

2023-04-06 · Marta Fochesato, Filippo Fabiani, John Lygeros

We consider generalized Nash equilibrium problems (GNEPs) with linear coupling constraints affected by both local (i.e., agent-wise) and global (i.e., shared resources) disturbances taking values in polyhedral uncertaint…

Distributed Nash Equilibrium Seeking Algorithm Design for Multi-Cluster Games with High-Order Players

2021-06-25 · Zhenhua Deng, Yangyang Liu

In this paper, a multi-cluster game with high-order players is investigated. Different from the well-known multi-cluster games, the dynamics of players are taken into account in our problem. Due to the high-order dynamic…