Approximating the best Nash Equilibrium in sub-quasipolytime breaks the Exponential Time HypothesisDate: October 24, 2014Theory Lunch Talk on ETH-based Computational Lower Bound for finding Good Nash Equilibria in two player game.Share on Twitter Facebook LinkedIn Previous Next
