41 citations · 84 across the 20 of their papers we have counts for
22 papers
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…
Revealing Strategic Interactions in Network Games Under Decaying Active Probing
Xiaoyu Xin, Longxu Zhang, Jinlong Lei +1
Revealing the interaction topology underlying strategic behavior is fundamental to prediction, intervention, and policy design in networked systems. Yet the interaction matrix is o…
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…
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…
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…
Riemannian Optimistic Algorithms
Xi Wang, Deming Yuan, Yiguang Hong +3
In this paper, we consider Riemannian online convex optimization with dynamic regret. First, we propose two novel algorithms, namely the Riemannian Online Optimistic Gradient Desce…
Online Game with Time-Varying Coupled Inequality Constraints
Min Meng, Xiuxian Li, Yiguang Hong +2
In this paper, online game is studied, where at each time, a group of players aim at selfishly minimizing their own time-varying cost function simultaneously subject to time-varyin…
Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition
Xinlei Yi, Xiuxian Li, Tao Yang +4
This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portio…
Distributed Non-Bayesian Learning for Games with Incomplete Information
Shijie Huang, Jinlong Lei, Yiguang Hong
We consider distributed learning problem in games with an unknown cost-relevant parameter, and aim to find the Nash equilibrium while learning the true parameter. Inspired by the s…
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…
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…
A Survey of Decision Making in Adversarial Games
Xiuxian Li, Min Meng, Yiguang Hong +1
Game theory has by now found numerous applications in various fields, including economics, industry, jurisprudence, and artificial intelligence, where each player only cares about…
No-Regret Learning in Network Stochastic Zero-Sum Games
Shijie Huang, Jinlong Lei, Yiguang Hong
No-regret learning has been widely used to compute a Nash equilibrium in two-person zero-sum games. However, there is still a lack of regret analysis for network stochastic zero-su…
No-regret learning for repeated non-cooperative games with lossy bandits
Wenting Liu, Jinlong Lei, Peng Yi +1
This paper considers no-regret learning for repeated continuous-kernel games with lossy bandit feedback. Since it is difficult to give the explicit model of the utility functions i…
Multi-agent consensus over time-invariant and time-varying signed digraphs via eventual positivity
Angela Fontan, Lingfei Wang, Yiguang Hong +2
Laplacian dynamics on signed digraphs have a richer behavior than those on nonnegative digraphs. In particular, for the so-called "repelling" signed Laplacians, the marginal stabil…
On Faster Convergence of Scaled Sign Gradient Descent
Xiuxian Li, Kuo-Yi Lin, Li Li +2
Communication has been seen as a significant bottleneck in industrial applications over large-scale networks. To alleviate the communication burden, sign-based optimization algorit…
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…