119 search results - page 5 / 24 » The complexity of pure Nash equilibria |
JEA
2006
14 years 9 months ago
2006
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
101
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
The class of weakly acyclic games, which includes potential games and dominance-solvable games, captures many practical application domains. Informally, a weakly acyclic game is on...
103
Voted
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
85
Voted
TCS
2010
14 years 7 months 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...