42 search results - page 2 / 9 » New Maximal Numbers of Equilibria in Bimatrix Games |
MFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
AAAI
2007
13 years 8 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
CDC
2009
IEEE
13 years 10 months ago
2009
IEEE
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...