Classical and quantum computing of Nash equilibria of two-player games

Nash equilibrium is an important concept in game theory. However, finding mixed-strategy Nash equilibria is computationally hard even for relatively small games. I will review some aspects of the numerical computation of Nash equilibria of two-player games including the Lemke-Howson algorithm. I will also discuss preliminary attempts at solving the Nash equilibrium problem on a quantum computer by the quantum approximate optimization algorithm.