FIX: DOC: Minor fixes

Author: oyamad

quantecon/game_theory/lemke_howson.py

@@ -93,7 +93,7 @@ def lemke_howson(g, init_pivot=0, max_iter=10**6, capping=None,
         `init_pivot` + (m+n-1) (modulo m+n) as the initial pivot, with a
         limit `max_iter` on the total number of pivoting steps.
 
-      Accoding to the simulation results for *uniformly random games*,
+      According to the simulation results for *uniformly random games*,
       for medium- to large-size games this heuristics outperforms the
       basic Lemke-Howson algorithm with a fixed initial pivot, where
       [1]_ suggests that `capping` be set to 10.
@@ -124,8 +124,7 @@ def lemke_howson(g, init_pivot=0, max_iter=10**6, capping=None,
     nums_actions = g.nums_actions
     total_num = sum(nums_actions)
 
-    msg = '`init_pivot` must be an integer k' + \
-          'such that 0 <= k < {0}'.format(total_num)
+    msg = f'`init_pivot` must be an integer k such that 0 <= k < {total_num}'
 
     if not isinstance(init_pivot, numbers.Integral):
         raise TypeError(msg)
@@ -320,7 +319,7 @@ def _lemke_howson_tbl(tableaux, bases, init_pivot, max_iter):
     """
     Main body of the Lemke-Howson algorithm implementation.
 
-    Perform the complementary pivoting. Modify `tablaux` and `bases` in
+    Perform the complementary pivoting. Modify `tableaux` and `bases` in
     place.
 
     Parameters

quantecon/optimize/pivoting.py

@@ -58,7 +58,7 @@ def _min_ratio_test_no_tie_breaking(tableau, pivot, test_col,
     """
     Perform the minimum ratio test, without tie breaking, for the
     candidate rows in `argmins[:num_candidates]`. Return the number
-    `num_argmins` of the rows minimizing the ratio and store thier
+    `num_argmins` of the rows minimizing the ratio and store their
     indices in `argmins[:num_argmins]`.
 
     Parameters