Sign Up to like & get
recommendations!
0
Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00763-x
Abstract: We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that ${\mathcal{NP}}$-hardness…
read more here.
Keywords:
symmetric win;
win lose;
bimatrix games;
nash equilibria ... See more keywords