What is it about?
this paper advances the computational complexity of finding Nash equilibrium in two-player games to zero-error probabilistic polynomial.
Featured Image
Read the Original
This page is a summary of: Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time, Information Sciences, May 2025, Elsevier,
DOI: 10.1016/j.ins.2024.121783.
You can read the full text:
Contributors
The following have contributed to this page
