41 citations · 77 across the 23 of their papers we have counts for
25 papers
Distributed Team Orchestration via Supervisor Networks: Convergence, Optimality, and Resilience
Juntian Zhu, Guanpu Chen, Tongtian Zhu +3
In this paper, we study zero-sum potential team games with a supervisor network, where agents rely on supervisor-provided belief information rather than accurate common beliefs. Th…
Distributed Algorithm for Robust Wardrop Equilibrium in Uncertain Aggregative Congestion Games
Huan Peng, Guanpu Chen, Giuseppe Belgioioso +1
This paper considers a class of aggregative congestion games with uncertain coupling constraints, and devises a distributed algorithm to seek the robust generalized Wardrop equilib…
Zero-determinant Strategy for Moving Target Defense: Existence, Performance, and Computation
Zhaoyang Cheng, Guanpu Chen, Yiguang Hong +2
Moving Target Defense (MTD) is commonly formulated as a repeated security game to mitigate persistent threats. Although the strong Stackelberg equilibrium (SSE) characterizes the d…
A Scenario Approach to the Robustness of Nonconvex-Nonconcave Minimax Problems
Huan Peng, Guanpu Chen, Karl Henrik Johansson
This paper investigates probabilistic robustness of nonconvex-nonconcave minimax problems via the scenario approach. Specifically, under convex strategy sets for all players, inspi…
BG-FlipIn: A Bayesian game framework for FlipIt-insider models in advanced persistent threats
Yang Jiao, Guanpu Chen, Yiguang Hong
In this paper, we study advanced persistent threats (APT) with an insider who has different preferences. To address the uncertainty of the insider's preference, we propose the BG-F…
Privacy Guarantee for Nash Equilibrium Computation of Aggregative Games Based on Pointwise Maximal Leakage
Zhaoyang Cheng, Guanpu Chen, Tobias J. Oechtering +1
Privacy preservation has served as a key metric in designing Nash equilibrium (NE) computation algorithms. Although differential privacy (DP) has been widely employed for privacy g…
Bayesian hypergame approach to equilibrium stability and robustness in moving target defense
Hanzheng Zhang, Zhaoyang Cheng, Guanpu Chen +1
We investigate the equilibrium stability and robustness in a class of moving target defense problems, in which players have both incomplete information and asymmetric cognition. We…
A Multi-Player Potential Game Approach for Sensor Network Localization with Noisy Measurements
Gehui Xu, Guanpu Chen, Baris Fidan +4
Sensor network localization (SNL) is a challenging problem due to its inherent non-convexity and the effects of noise in inter-node ranging measurements and anchor node position. W…
Inverse learning of black-box aggregator for robust Nash equilibrium
Guanpu Chen, Gehui Xu, Fengxiang He +3
In this note, we investigate the robustness of Nash equilibria (NE) in multi-player aggregative games with coupling constraints. There are many algorithms for computing an NE of an…
Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation
Gehui Xu, Guanpu Chen, Yiguang Hong +3
Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor…
Non-convex potential games for finding global solutions to sensor network localization
Gehui Xu, Guanpu Chen, Yiguang Hong +3
Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and th…
Equalizer zero-determinant strategy in discounted repeated Stackelberg asymmetric game
Zhaoyang Cheng, Guanpu Chen, Yiguang Hong
This paper focuses on the performance of equalizer zero-determinant (ZD) strategies in discounted repeated Stackerberg asymmetric games. In the leader-follower adversarial scenario…
Global Nash Equilibrium in Non-convex Multi-player Game: Theory and Algorithms
Guanpu Chen, Gehui Xu, Fengxiang He +3
Wide machine learning tasks can be formulated as non-convex multi-player games, where Nash equilibrium (NE) is an acceptable solution to all players, since no one can benefit from…
Bayesian Nash Equilibrium Seeking for Distributed Incomplete-information Aggregative Games
Hanzheng Zhang, Guanpu Chen, Huashu Qin
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 an…
Zero-Determinant Strategy in Stochastic Stackelberg Asymmetric Security Game
Zhaoyang Cheng, Guanpu Chen, Yiguang Hong
In a stochastic Stackelberg asymmetric security game, the strong Stackelberg equilibrium (SSE) strategy is a popular option for the defender to get the highest utility against an a…
Coincidence analysis of Stackelberg and Nash equilibria in three-player leader-follower security games
Gehui Xu, Guanpu Chen, Zhaoyang Cheng +2
There has been significant recent interest in leader-follower security games, where the leader dominates the decision process with the Stackelberg equilibrium (SE) strategy. Howeve…
Defense for Advanced Persistent Threat with Inadvertent or Malicious Insider Threats
Ziqin Chen, Guanpu Chen, Yiguang Hong
In this paper, we propose a game-theoretical framework to investigate advanced persistent threat problems with two types of insider threats: malicious and inadvertent. Within this…
Distributed Algorithm for Continuous-type Bayesian Nash Equilibrium in Subnetwork Zero-sum Games
Hanzheng Zhang, Guanpu Chen, Yiguang Hong
In this paper, we consider a continuous-type Bayesian Nash equilibrium (BNE) seeking problem in subnetwork zero-sum games, which is a generalization of deterministic subnetwork zer…
Algorithm design and approximation analysis on distributed robust game
Gehui Xu, Guanpu Chen, Hongsheng Qi
We design a distributed algorithm to seek generalized Nash equilibria of a robust game with uncertain coupled constraints. Due to the uncertainty of parameters in set constraints,…
Achieving Social Optimum in Non-convex Cooperative Aggregative Games: A Distributed Stochastic Annealing Approach
Yinghui Wang, Xiaoxue Geng, Guanpu Chen +1
This paper designs a distributed stochastic annealing algorithm for non-convex cooperative aggregative games, whose agents' cost functions not only depend on agents' own decision v…
Efficient algorithm for approximating Nash equilibrium of distributed aggregative games
Gehui Xu, Guanpu Chen, Hongsheng Qi +1
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, projectionb…
Distributed Mirror Descent Algorithm with Bregman Damping for Nonsmooth Constrained Optimization
Guanpu Chen, Weijian Li, Gehui Xu +1
To solve distributed optimization efficiently with various constraints and nonsmooth functions, we propose a distributed mirror descent algorithm with embedded Bregman damping, as…
Single-Leader-Multiple-Followers Stackelberg Security Game with Hypergame Framework
Zhaoyang Cheng, Guanpu Chen, Yiguang Hong
In this paper, we employ a hypergame framework to analyze the single-leader-multiple-followers (SLMF) Stackelberg security game with two typical misinformed situations: mispercepti…
Distributed Optimization with Projection-free Dynamics
Guanpu Chen, Peng Yi, Yiguang Hong +1
We consider continuous-time dynamics for distributed optimization with set constraints in the paper. To handle the computational complexity of projection-based dynamics due to solv…