6 papers · 1 filter
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…
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…
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…
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…
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…
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…