70 search results - page 4 / 14 » Polynomial Algorithms for Approximating Nash Equilibria of B... |
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...
SIGECOM
2004
ACM
14 years 4 days ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
SIGECOM
2006
ACM
14 years 20 days ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
ATAL
2006
Springer
13 years 10 months ago
2006
Springer
We present a technique for reducing a normal-form (aka. (bi)matrix) game, O, to a smaller normal-form game, R, for the purpose of computing a Nash equilibrium. This is done by com...
FOCS
2006
IEEE
14 years 23 days 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...