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