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

by   Duong Thuy Anh Nguyen, et al.

This paper presents a new distributed algorithm that leverages heavy-ball momentum and a consensus-based gradient method to find a Nash equilibrium (NE) in a class of non-cooperative convex games with unconstrained action sets. In this approach, each agent in the game has access to its own smooth local cost function and can exchange information with its neighbors over a communication network. The main novelty of our work is the incorporation of heavy-ball momentum in the context of non-cooperative games that operate on fully-decentralized, directed, and time-varying communication graphs, while also accommodating non-identical step-sizes and momentum parameters. Overcoming technical challenges arising from the dynamic and asymmetric nature of mixing matrices and the presence of an additional momentum term, we provide a rigorous proof of the geometric convergence to the NE. Moreover, we establish explicit bounds for the step-size values and momentum parameters based on the characteristics of the cost functions, mixing matrices, and graph connectivity structures. We perform numerical simulations on a Nash-Cournot game to demonstrate accelerated convergence of the proposed algorithm compared to that of the existing methods.


page 1

page 2

page 3

page 4


Distributed Nash Equilibrium Seeking over Time-Varying Directed Communication Networks

We study distributed algorithms for finding a Nash equilibrium (NE) in a...

Fully distributed Nash equilibrium seeking over time-varying communication networks with linear convergence rate

We design a distributed algorithm for learning Nash equilibria over time...

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...

Efficient Distributed Learning in Stochastic Non-cooperative Games without Information Exchange

In this work, we study stochastic non-cooperative games, where only nois...

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...

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

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

Please sign up or login with your details

Forgot password? Click here to reset