20 search results - page 1 / 4 » Large Supports are Required for Well-Supported Nash Equilibr... |
MFCS
2007
Springer
14 years 5 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...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
ISPDC
2008
IEEE
14 years 5 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
TCS
2008
13 years 10 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We exhibit the rich structure of the set of correlated equilibria by analyzing the simplest of polynomial games: the mixed extension of matching pennies. We show that while the co...