Smoothed complexity of 2-player Nash equilibria

DOI10.1109/FOCS46700.2020.00034MaRDI QIDQ6944022zbMATH OpenFDO

Authors Shant Boodaghians, Joshua Brakensiek, Samuel B. Hopkins, Aviad Rubinstein

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00034

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(3)

• Smooth Nash equilibria: algorithms and complexity
• A polynomial-time algorithm for 1/3-approximate Nash equilibria in bimatrix games
• Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time

This page was built for publication: Smoothed complexity of 2-player Nash equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944022)