Dian Gadjov

University of Toronto | U of T · Department of Electrical and Computer Engineering

Current research in distributed Nash equilibrium (NE) seeking in the partial information setting assumes that information is exchanged between agents that are “truthful”. However, in general noncooperative games agents may consider sending misinformation to neighboring agents with the goal of further reducing their cost. Additionally, communication...

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 propose a passivity-based modification of the standard gradient-play dynamics, that we call “Heavy Anchor”. We prove that Heavy Anchor allows a relaxation of strict monoto...

Current research in distributed Nash equilibrium (NE) seeking in the partial information setting assumes that information is exchanged between agents that are "truthful". However, in general noncooperative games agents may consider sending misinformation to neighboring agents with the goal of further reducing their cost. Additionally, communication...

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 propose a passivity-based modification of the standard gradient-play dynamics, that we call "Heavy Anchor". We prove that Heavy Anchor allows a relaxation of strict monoto...

We consider aggregative games with affine coupling constraints, where agents have partial information on the aggregate value and can only obtain information from neighbouring agents. We propose a single-layer distributed algorithm that reaches a variational generalized Nash equilibrium, under constant step sizes. The algorithm works on a single tim...

We consider the framework of aggregative games with affine coupling constraints, where agents have partial information of the aggregate value and can only obtain information from neighboring agents. We propose a single-layer distributed algorithm that reaches a variational generalized Nash equilibrium, under constant step sizes. The algorithm works...

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 continuous-time gradient-play dynamics that converges to an NE under strict monotonicity of the pseudo-gradient and assumes perfect information, i.e., instantaneous all-to-all p...