Automating approximation analysis for Nash equilibria algorithms in two-player games

Computing polynomial-time approximate Nash equilibria (NE) is a fundamental problem in algorithmic game theory, with deep connections to the complexity class TFNP. Recent advances in approximate NE algorithms have become increasingly sophisticated, making the verification of their approximation guar...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 307; S. 105362
Hauptverfasser:	Deng, Xiaotie, Li, Dongchen, Li, Hanyu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.11.2025
Schlagworte:	Algorithmic game theory Approximation algorithms Automated algorithm analysis Nash equilibrium Verification Nash equilibrium Approximation algorithms Automated algorithm analysis Verification Algorithmic game theory
ISSN:	0890-5401
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!