ENDM
2010
14 years 11 days ago
2010
Electronic Notes in Discrete Mathematics 36 (2010) 1065
APPROX
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
FOCS
2004
IEEE
14 years 4 months ago
2004
IEEE
The Lemke
ICALP
2007
Springer
14 years 4 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...
ATAL
2005
Springer
14 years 5 months ago
2005
Springer
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
ISPDC
2008
IEEE
14 years 6 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...
SAGT
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...