Supervisor: Michail Fasoulakis

Nash equilibrium is one of the most fundamental solution concepts in game theory, where we know its existence in any finite game. In this project, we are interested in the computation of a Nash equilibrium in the specific class of bimatrix zero-sum games. We will study learning algorithms for computing (approximate) Nash equilibria in zero-sum … full description “Algorithms for Nash equilibria in zero-sum games (available)”