4 citations · 10 across the 8 of their papers we have counts for
9 papers
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…
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…
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…
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,…
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…