170 search results - page 3 / 34 » Parallel Computation of Nash Equilibria in N-Player Games |
CDC
2009
IEEE
14 years 12 days ago
2009
IEEE
— Achieving the Nash equilibria for single objective games is known to be a computationally difficult problem. However there is a special class of equilibria called evolutionary...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We present an algorithm to compute a parametric description of the totally mixed Nash equilibria of a generic game in normal form with a fixed structure. Using this representatio...
DAGSTUHL
2007
13 years 9 months ago
2007
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...