AI Chat AI Image Generator AI Video Text to Speech

Fast Complete Algorithm for Multiplayer Nash Equilibrium

02/11/2020

∙

by Sam Ganzfried, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 09/08/2023

Computation of Nash Equilibria of Attack and Defense Games on Networks

We consider the computation of a Nash equilibrium in attack and defense ...

0 Stanisław Kaźmierowski, et al. ∙

research

∙ 11/10/2022

Slightly Altruistic Nash Equilibrium for Multi-agent Pursuit-Evasion Games With Input Constraints

This is an initial manuscript that presents the basic idea of "slightly ...

0 Dongting Li, et al. ∙

research

∙ 02/17/2019

Limited Lookahead in Imperfect-Information Games

Limited lookahead has been studied for decades in complete-information g...

0 Christian Kroer, et al. ∙

research

∙ 06/10/2022

The Generalized Eigenvalue Problem as a Nash Equilibrium

The generalized eigenvalue problem (GEP) is a fundamental concept in num...

0 Ian Gemp, et al. ∙

research

∙ 04/01/2021

Back to Square One: Superhuman Performance in Chutes and Ladders Through Deep Neural Networks and Tree Search

We present AlphaChute: a state-of-the-art algorithm that achieves superh...

0 Dylan Ashley, et al. ∙

research

∙ 01/10/2023

Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling

We give a quantum algorithm for computing an ϵ-approximate Nash equilibr...

0 Adam Bouland, et al. ∙

research

∙ 12/07/2021

Approximating Nash Equilibrium in Random Graphical Games

Computing Nash equilibrium in multi-agent games is a longstanding challe...

0 Morris Yau, et al. ∙