We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 42e6e9c commit 455d603Copy full SHA for 455d603
1 file changed
doc/tools.lcp.rst
@@ -9,7 +9,7 @@ computes Nash equilibria by finding solutions to a linear
9
complementarity problem. For extensive games, the program uses the
10
sequence form representation of the extensive game, as defined by
11
Koller, Megiddo, and von Stengel [KolMegSte94]_, and applies the
12
-algorithm developed by Lemke. For strategic games, the program using
+algorithm developed by Lemke. For strategic games, the program uses
13
the method of Lemke and Howson [LemHow64]_. There exist strategic
14
games for which some equilibria cannot be located by this method; see
15
Shapley [Sha74]_.
0 commit comments