Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2017
2017
The complexity of continuous local search
The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some… 
2013
2013
Applied Hypergame Theory for Network Defense
Abstract : Cyber operations are the most important aspect of military conflicts in the 21st century, but unfortunately they are… 
2011
2011
EGG study of Czech phoneme /r/
The article utilizes electroglottography (EGG) to test for a difference in laryngeal setting as the potential source of acoustic… 
2010
2010
Finding Gale Strings
2010
2010
Cognitive information technology adaptive implementation control and Nash equilibrium realization in case teaching
Information technology applications become more extensive in the field of education; its impact has become increasingly in-depth… 
2009
2009
On the Complexity of Deciding Degeneracy in Games
We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a… 
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… 
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… 
1997
1997
Lemke-Howson method with arbitrary starting strategy
1~inding a Nash equilibrium in a bimatrix garne is an important problem in garne theory. 'I'Ire algorithrn of Lernke and flowson… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)