Sciweavers

17 search results - page 1 / 4
» Equilibrium Tracing in Bimatrix Games
Sort
View
DAGSTUHL
2007
13 years 6 months ago
Equilibrium Tracing in Bimatrix Games
Abstract. We analyze the relations of the van den Elzen-Talman algorithm, the Lemke-Howson algorithm and the global Newton method introduced by Govindan and Wilson. It is known tha...
Anne Balthasar
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 6 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
ENDM
2010
87views more  ENDM 2010»
13 years 5 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
ICPP
2009
IEEE
13 years 11 months ago
Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration
—Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in t...
Jonathan Widger, Daniel Grosu