Distributed Nash Equilibrium Seeking over Time-Varying Directed Communication Networks

by   Duong Thuy Anh Nguyen, et al.

We study distributed algorithms for finding a Nash equilibrium (NE) in a class of non-cooperative convex games under partial information. Specifically, each agent has access only to its own smooth local cost function and can receive information from its neighbors in a time-varying directed communication network. To this end, we propose a distributed gradient play algorithm to compute a NE by utilizing local information exchange among the players. In this algorithm, every agent performs a gradient step to minimize its own cost function while sharing and retrieving information locally among its neighbors. The existing methods impose strong assumptions such as balancedness of the mixing matrices and global knowledge of the network communication structure, including Perron-Frobenius eigenvector of the adjacency matrix and other graph connectivity constants. In contrast, our approach relies only on a reasonable and widely-used assumption of row-stochasticity of the mixing matrices. We analyze the algorithm for time-varying directed graphs and prove its convergence to the NE, when the agents' cost functions are strongly convex and have Lipschitz continuous gradients. Numerical simulations are performed for a Nash-Cournot game to illustrate the efficacy of the proposed algorithm.


Geometric Convergence of Distributed Heavy-Ball Nash Equilibrium Algorithm over Time-Varying Digraphs with Unconstrained Actions

This paper presents a new distributed algorithm that leverages heavy-bal...

Nash equilibrium seeking over digraphs with row-stochastic matrices and network-independent step-sizes

In this paper, we address the challenge of Nash equilibrium (NE) seeking...

Nash equilibrium seeking under partial-decision information over directed communication networks

We consider the Nash equilibrium problem in a partial-decision informati...

CrowdCache: A Decentralized Game-Theoretic Framework for Mobile Edge Content Sharing

Mobile edge computing (MEC) is a promising solution for enhancing the us...

Convergence Analysis of the Best Response Algorithm for Time-Varying Games

This paper studies a class of strongly monotone games involving non-coop...

Ensuring both Accurate Convergence and Differential Privacy in Nash Equilibrium Seeking on Directed Graphs

We study in this paper privacy protection in fully distributed Nash equi...

Finite-Time Error Bounds for Distributed Linear Stochastic Approximation

This paper considers a novel multi-agent linear stochastic approximation...

Please sign up or login with your details

Forgot password? Click here to reset