docs: def dominated_actions(self, tol=None, method=None):
          """
          Return a list of actions that are strictly dominated by some
          mixed actions.
  
          Parameters
          ----------
          tol : scalar(float), optional(default=None)
              Tolerance level used in determining domination. If None,
              default to the value of the `tol` attribute.
  
          method : str, optional(default=None)
              If None, `lemke_howson` from `quantecon.game_theory` is used
              to solve for a Nash equilibrium of an auxiliary zero-sum
              game. If `method` is set to `'simplex'` or
              `'interior-point'`, `scipy.optimize.linprog` is used with
              the method as specified by `method`.
  
          Returns
          -------
          list(int)
              List of integers representing pure actions, each of which is
              strictly dominated by some mixed action.
  
          """
          out = []
          for action in range(self.num_actions):
              if self.is_dominated(action, tol=tol, method=method):
                  out.append(action)
          return out