From fc8c5fd873fd1aed21fab84d8b444aff9b2e2ac1 Mon Sep 17 00:00:00 2001 From: rahulsavani Date: Tue, 4 Nov 2025 20:35:17 +0000 Subject: [PATCH] typo in tools.lcp.rst --- doc/tools.lcp.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/tools.lcp.rst b/doc/tools.lcp.rst index 14795d9bf..c17e636d8 100644 --- a/doc/tools.lcp.rst +++ b/doc/tools.lcp.rst @@ -9,7 +9,7 @@ computes Nash equilibria by finding solutions to a linear complementarity problem. For extensive games, the program uses the sequence form representation of the extensive game, as defined by Koller, Megiddo, and von Stengel [KolMegSte94]_, and applies the -algorithm developed by Lemke. For strategic games, the program using +algorithm developed by Lemke. For strategic games, the program uses the method of Lemke and Howson [LemHow64]_. There exist strategic games for which some equilibria cannot be located by this method; see Shapley [Sha74]_.