Gambit: Software Tools for Game Theory | ||
---|---|---|
<<< Previous | Reference: Algorithms to Compute Nash Equilibria | Next >>> |
Performs a grid search to compute the complete logistic quantal response correspondence, as described in [McKPal95].
![]() | This algorithm is very computationally intensive, and should only be attempted on small games. |
\item[Grid 1 Del:] Grid size for search over course grid of probability space. \item[Grid 1 Tol:] Maximum value of objective function for which to accept solution on course grid. \item[Grid 2 Del:] Grid size for search over fine grid of probability space. \item[Grid 2 Tol:] Maximum value of objective function for which to accept solution on fine grid.
<<< Previous | Home | Next >>> |
QreSolve | Up | LcpSolve |