34 search results - page 2 / 7 » Finding Equilibria in Games of No Chance |
WINE
2007
Springer
13 years 11 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
TARK
2007
Springer
13 years 11 months ago
2007
Springer
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
TCS
2008
13 years 5 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 ...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...