Lemke–Howson algorithm
The Lemke–Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and .It is said to be "the best known among the combinatorial algorithms for finding a Nash equilibrium", although more recently the Porter-Nudelman-Shoham algorithm has outperformed on a number of benchmarks.
- Comment
- enThe Lemke–Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and .It is said to be "the best known among the combinatorial algorithms for finding a Nash equilibrium", although more recently the Porter-Nudelman-Shoham algorithm has outperformed on a number of benchmarks.
- Date
- enJuly 2021
- Has abstract
- enThe Lemke–Howson algorithm is an algorithm that computes a Nash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and .It is said to be "the best known among the combinatorial algorithms for finding a Nash equilibrium", although more recently the Porter-Nudelman-Shoham algorithm has outperformed on a number of benchmarks.
- Is primary topic of
- Lemke–Howson algorithm
- Label
- enLemke–Howson algorithm
- Link from a Wikipage to another Wikipage
- Algorithm
- Bimatrix game
- Carlton E. Lemke
- Category:Combinatorial algorithms
- Category:Game theory
- Category:Non-cooperative games
- Homotopy
- J. T. Howson
- Nash equilibrium
- Polytope
- PSPACE-complete
- Reason
- enShould use for equations and variables and expressions.
- SameAs
- 4pkxB
- Lemke-Hauson algoritam
- m.0q3xs5w
- Q6521170
- אלגוריתם Lemke-Howson
- الگوریتم لمکه-هاوسون
- 莱姆克-豪森算法
- Subject
- Category:Combinatorial algorithms
- Category:Game theory
- Category:Non-cooperative games
- WasDerivedFrom
- Lemke–Howson algorithm?oldid=1098579300&ns=0
- WikiPageLength
- 10158
- Wikipage page ID
- 38282904
- Wikipage revision ID
- 1098579300
- WikiPageUsesTemplate
- Template:Cleanup
- Template:Reflist
- Template:Tl