224 search results - page 11 / 45 » On Nash-Equilibria of Approximation-Stable Games |
185
click to vote
TCS
2010
15 years 5 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...
198
click to vote
FORMATS
2010
Springer
15 years 4 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
159
click to vote
CG
2006
Springer
15 years 10 months ago
2006
Springer
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
172
click to vote
ATAL
2007
Springer
16 years 24 days ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
168
click to vote
AAAI
2006
15 years 8 months ago
2006
We embark on an initial study of a new class of strategic (normal-form) games, so-called ranking games, in which the payoff to each agent solely depends on his position in a ranki...