activity
20192022
most citedEfficient algorithm for approximating Nash equilibrium of distributed aggregative games

3 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2022

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…

math.OC2022

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,…

math.OC20223 cited

Achieving Social Optimum in Non-convex Cooperative Aggregative Games: A Distributed Stochastic Annealing Approach

Yinghui Wang, Xiaoxue Geng, Guanpu Chen +1

This paper designs a distributed stochastic annealing algorithm for non-convex cooperative aggregative games, whose agents' cost functions not only depend on agents' own decision v…

math.OC20213 cited

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…

math.OC2021

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…

math.OC2019

Distributed sub-optimal resource allocation via a projected form of singular perturbation

Shu Liang, Xianlin Zeng, Guanpu Chen +1

Distributed optimization for resource allocation problems is investigated and a sub-optimal continuous-time algorithm is proposed. Our algorithm has lower order dynamics than other…