Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
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.
2019
2019
The Lemke–Howson Algorithm Solving Finite Non-Cooperative Three-Person Games in a Special Setting
We present a brief outline of an approximate method (3LP) proposed by E.G. Golshteyn for solving three-person games in mixed… Expand
  • table 1
  • table 2
Is this relevant?
2017
2017
CLS: New Problems and Completeness
The complexity class CLS was introduced by Daskalakis and Papadimitriou with the goal of capturing the complexity of some well… Expand
  • figure 1
  • table 2
  • table 5
  • 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 fix point problems, as well as the Harsanyi-Selten equilibrium selection… Expand
  • figure 1
Is this relevant?
2010
2010
Packet forwarding in overlay wireless sensor networks using NashQ reinforcement learning
This paper proposes a NASH Q-learning (NashQ) algorithm in a packet forwarding game in overlay noncooperative multi-agent… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Separable and low-rank continuous games
In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form… Expand
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
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… Expand
  • table 1
Is this relevant?
2003
2003
Long Lemke-Howson Paths
The Lemke-Howson algorithm is the classical algorithm for find- ing one equilibrium of a bimatrix game. In this paper we present… Expand
  • table 1
Is this relevant?
2000
2000
On-Site Partial Discharge Monitoring using the differential LEMKE PROBE LDP-5 and its accessories
The differential LEMKE PROBE LDP-5 can be used for an quick scan of the partial discharge (PD) level of the different high… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 4
Is this relevant?
1991
1991
Implementing the modified LH algorithm
The modified Lemke-Howson algorithm is a constructive procedure which enables us to compute equilibrium points of a bimatrix game… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE