Well Supported Approximate Equilibria in Bimatrix Games

摘要

In view of the apparent intractability of constructing Nash Equilibria (NE in short) in polynomial time, even for bimatrix games, understanding the limitations of the approximability of the problem is an important challenge.