10 citations · 25 across the 7 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.GT2010★ 2 cited
Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games
Albert Xin Jiang, Kevin Leyton-Brown
In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm ("Ellipsoid Against Hope") for computing sample correlated equilibria of concisely-represen…
cs.GT2010
Pure Nash Equilibria: Complete Characterization of Hard and Easy Graphical Games
Albert Xin Jiang, MohammadAli Safari
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special…