Related papers: Fast Complete Algorithm for Multiplayer Nash Equilibrium

URL: http://arxiv.org/abs/2002.04734v9
Date: Fri, 9 Dec 2022 07:03:01 GMT
Title: Fast Complete Algorithm for Multiplayer Nash Equilibrium
Authors: Sam Ganzfried
Abstract summary: We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games. We demonstrate that the algorithm runs significantly faster than the prior fastest complete algorithm on several game classes previously studied.
Score: 1.7132914341329848
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: We describe a new complete algorithm for computing Nash equilibrium in multiplayer general-sum games, based on a quadratically-constrained feasibility program formulation. We demonstrate that the algorithm runs significantly faster than the prior fastest complete algorithm on several game classes previously studied and that its runtimes even outperform the best incomplete algorithms.

Err

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.