41 citations · 77 across the 23 of their papers we have counts for
12 papers · 1 filter
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…
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…
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…
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…
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…