The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equilibria of stochastic games.

Two assumptions are used to justify selection of equilibria in stable sets. One assumption requires that a selected set is invariant to addition of redundant strategies. The other is a strong version of backward induction. Backward induction is interpreted as the requirement that behavior...

This paper describes ways that the definition of an equilibrium among players' strategies in a game can be sharpened by invoking additional criteria derived from decision theory. Refinements of John Nash's 1950 definition aim primarily to distinguish equilibria in which implicit commitments are...

We examine Hillas and Kohlberg's conjecture that invariance to the addition of payoff-redundant strategies implies that a backward induction outcome survives deletion of strategies that are inferior replies to all equilibria with the same outcome. That is, invariance and backward induction imply...

Three axioms from decision theory are applied to refinements that select connected subsets of the Nash equilibria of games with perfect recall. The first axiom requires all equilibria in a selected subset to be admissible, i.e. each player's strategy is an admissible optimal reply to other...