Distributed Nash Equilibrium Seeking in Non-Monotone Games over the Simplex

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Tatarenko, Tatiana, Etesami, S. Rasoul
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911062085861376
author Tatarenko, Tatiana
Etesami, S. Rasoul
author_facet Tatarenko, Tatiana
Etesami, S. Rasoul
contents In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the regularized game with the set of Nash equilibria, and formulate a multi-objective optimization problem to solve the regularized game. Based on the obtained properties of the stationary points in this optimization problem, we formulate two distributed heuristic algorithms to compute an approximate Nash equilibrium of the original game.
format Preprint
id arxiv_https___arxiv_org_abs_2507_13244
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Distributed Nash Equilibrium Seeking in Non-Monotone Games over the Simplex
Tatarenko, Tatiana
Etesami, S. Rasoul
Optimization and Control
In this work, we present a novel characterization of approximate Nash equilibria in a class of convex games over the simplex. To achieve this, we regularize the utility functions using the Shannon entropy term, connect the solutions to the regularized game with the set of Nash equilibria, and formulate a multi-objective optimization problem to solve the regularized game. Based on the obtained properties of the stationary points in this optimization problem, we formulate two distributed heuristic algorithms to compute an approximate Nash equilibrium of the original game.
title Distributed Nash Equilibrium Seeking in Non-Monotone Games over the Simplex
topic Optimization and Control
url https://arxiv.org/abs/2507.13244