# Distributed Nash Equilibrium Seeking with Stochastic Event-Triggered Mechanism

arXiv: https://arxiv.org/abs/2304.10338 · HTML: https://mlsanity.com/paper/2304.10338/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Apr 2023.

## Built on by (most cited first, 1 of 1)

- [Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy](https://mlsanity.com/paper/2408.04315/) (2024)

## Abstract (arXiv)

In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking where a network of players, abstracted as a directed graph, aim to minimize their own local cost functions non-cooperatively. Considering the limited energy of players and constrained bandwidths, we propose a stochastic event-triggered algorithm by triggering each player with a probability depending on certain events, which improves communication efficiency by avoiding continuous communication. We show that the distributed algorithm with the developed event-triggered communication scheme converges to the exact NE exponentially if the underlying communication graph is strongly connected. Moreover, we prove that our proposed event-triggered algorithm is free of Zeno behavior. Finally, numerical simulations for a spectrum access game are provided to illustrate the effectiveness of the proposed mechanism by comparing it with some existing event-triggered methods.