# Distributed forward-backward (half) forward algorithms for generalized Nash equilibrium seeking

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

## Key facts

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

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

- [An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems](https://mlsanity.com/paper/2410.02400/) (2024)

## Abstract (arXiv)

We present two distributed algorithms for the computation of a generalized Nash equilibrium in monotone games. The first algorithm follows from a forward-backward-forward operator splitting, while the second, which requires the pseudo-gradient mapping of the game to be cocoercive, follows from the forward-backward-half-forward operator splitting. Finally, we compare them with the distributed, preconditioned, forward-backward algorithm via numerical experiments.