144 search results - page 4 / 29 » Computing Nash Equilibria of Action-Graph Games |
112
click to vote
DAGSTUHL
2007
15 years 3 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....
104
click to vote
SOFSEM
2009
Springer
15 years 10 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...
86
Voted
CSE
2009
IEEE
15 years 8 months ago
2009
IEEE
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
177
Voted
WINE
2010
Springer
14 years 11 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
124
Voted
TCS
2010
15 years 7 days ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...