Matches in DBpedia 2016-04 for { ?s ?p "The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.It is said to be “the best known among the combinatorial algorithms for finding a Nash equilibrium”."@en }
Showing triples 1 to 4 of
4
with 100 triples per page.
- Lemke–Howson_algorithm abstract "The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.It is said to be “the best known among the combinatorial algorithms for finding a Nash equilibrium”.".
- Q6521170 abstract "The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.It is said to be “the best known among the combinatorial algorithms for finding a Nash equilibrium”.".
- Lemke–Howson_algorithm comment "The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.It is said to be “the best known among the combinatorial algorithms for finding a Nash equilibrium”.".
- Q6521170 comment "The Lemke–Howson algorithmis an algorithm that computes aNash equilibrium of a bimatrix game, named after its inventors, Carlton E. Lemke and J. T. Howson.It is said to be “the best known among the combinatorial algorithms for finding a Nash equilibrium”.".