Computation of equilibriain noncooperative games

The computational aspects of passage from a recursive presentation of a game to its extensive form are also discussed. For nontrivial inputs the concatenation of this procedure with the equilibrium computation is time intensive, but has low spatial requirements. Given a recursively represented game, with a position space bound S(n) and a log space computable next move relation, we can compute an example mixed strategy satisfying the sequential equilibria condition, all in space bound O(S(n)2), Furthermore, in space O(S(n)3), we can compute the connected components of mixed strategies satisfying sequential equilibria.