— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...