83 search results - page 6 / 17 » A Continuation Method for Nash Equilibria in Structured Game... |
ICTAI
2006
IEEE
15 years 3 months ago
2006
IEEE
We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structure...
NIPS
2003
14 years 11 months ago
2003
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
103
click to vote
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
SIROCCO
2008
14 years 11 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...
104
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...