14 search results - page 1 / 3 » New Results on the Complexity of Uniformly Mixed Nash Equili... |
WINE
2005
Springer
13 years 10 months ago
2005
Springer
FCT
2005
Springer
13 years 10 months ago
2005
Springer
TCS
2008
13 years 4 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 ...
ATAL
2008
Springer
13 years 6 months ago
2008
Springer
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...