Lemke–Howson algorithm

Known as: Lemke-Howson, Lemke-Howson algorithm 
The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T… (More)
Wikipedia

Related topics

Related topics

5 relations
AlgorithmList of PSPACE-complete problemsNash equilibriumPSPACE-complete

Broader (1)

Game theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Nash equilibria with partial monitoring; Computation and Lemke-Howson algorithm
In two player bi-matrix games with partial monitoring, actions played are not observed, only some messages are received. Those… (More)
  • figure 1
Is this relevant?
2012
2012
A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
Using the powerful machinery of the linear complementarity problem and Lemke's algorithm, we give a practical algorithm for… (More)
  • table 1
  • table 2
  • figure 1
  • table 4
Is this relevant?
2011
2011
The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions
We show that the widely used homotopy method for solving fixpoint problems, as well as the Harsanyi-Selten equilibrium selection… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Settling the complexity of computing two-player Nash equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
An experimental analysis of Lemke-Howson algorithm
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
What Does the Liar Say About the Truth ?
Many modern approaches to the Liar paradox have abandoned the search for its conclusive solution. The paradox is taken to have a… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Computing Nash Equilibria: Approximation and Smoothed Complexity
The authors advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
Inquiry in Interaction : How Local Adaptations of Curricula Shape Classroom Communities
In this study, we seek a better understanding of how individuals and their daily interactions shape and reshape social structures… (More)
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Exponentially many steps for finding a Nash equilibrium in a bimatrix game
The Lemke-Howson algorithm is the classical algorithm for the problem NASH of finding one Nash equilibrium of a bimatrix game. It… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 9
Is this relevant?
2003
2003
Long Lemke–Howson Paths
The Lemke–Howson algorithm is the classical algorithm for finding one equilibrium of a bimatrix game. In this paper we present a… (More)
  • table 1
Is this relevant?