3 search results - page 1 / 1 » Computing correlated equilibria of polynomial games via adap... |
CDC
2008
IEEE
14 years 8 days ago
2008
IEEE
— We construct a family of iterative discretization algorithms for computing sequences of finitely-supported correlated equilibria of n-player games with polynomial utility func...
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
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...