68 search results - page 3 / 14 » New Algorithms for Approximate Nash Equilibria in Bimatrix G... |
ATAL
2007
Springer
14 years 4 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
ESA
2009
Springer
14 years 16 days ago
2009
Springer
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
FOCS
2006
IEEE
14 years 17 hour ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
SAGA
2007
Springer
14 years 2 days ago
2007
Springer
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...