Sciweavers

ENDM
2010
101views more  ENDM 2010»
13 years 3 months ago
Finding Gale Strings
Electronic Notes in Discrete Mathematics 36 (2010) 1065
Marta M. Casetti, Julian Merschen, Bernhard von St...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 5 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
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...
Spyros C. Kontogiannis, Paul G. Spirakis
ICALP
2007
Springer
13 years 7 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
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...
Spyros C. Kontogiannis, Paul G. Spirakis
ATAL
2005
Springer
13 years 9 months ago
Theory of moves learners: towards non-myopic equilibria
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...
Arjita Ghosh, Sandip Sen
ISPDC
2008
IEEE
13 years 10 months ago
Computing Equilibria in Bimatrix Games by Parallel Support Enumeration
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...
Jonathan Widger, Daniel Grosu
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
13 years 10 months ago
The Computational Complexity of Weak Saddles
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...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...