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...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 307; p. 105362
Main Authors:	Deng, Xiaotie, Li, Dongchen, Li, Hanyu
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.11.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!