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.
Property | Value |
---|---|
dbo:abstract |
|
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink | |
dbp:date |
|
dbp:reason |
|
dbp:wikiPageUsesTemplate | |
dcterms:subject | |
rdf:type |
|
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:isPrimaryTopicOf | |
is dbo:knownFor of | |
is dbo:wikiPageRedirects of | |
is dbo:wikiPageWikiLink of | |
is dbp:knownFor of | |
is foaf:primaryTopic of |