337 citations · 424 across the 3 of their papers we have counts for
3 papers
math.OC2021★ 3 cited
On the exact convergence to Nash equilibrium in hypomonotone regimes under full and partial-information
Dian Gadjov, Lacra Pavel
In this paper, we consider distributed Nash equilibrium seeking in monotone and hypomonotone games. We first assume that each player has knowledge of the opponents' decisions and p…
math.OC2019★ 84 cited
Single-timescale distributed GNE seeking for aggregative games over networks via forward-backward operator splitting
Dian Gadjov, Lacra Pavel
We consider aggregative games with affine coupling constraints, where agents have partial information on the aggregate value and can only communicate with neighbouring agents. We p…
math.OC2017★ 337 cited
A Passivity-Based Approach to Nash Equilibrium Seeking over Networks
Dian Gadjov, Lacra Pavel
In this paper we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information. We start from a continu…