From a variant of Kuhn's triangulation we derive a discrete version of the Global Newton Method that yields an epsilon-equilibrium of an N-player game and then sequentially reduces epsilon toward zero to obtain any desired precision or the best precision for any number of iterations.

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.

We apply Mertens' dedinition of stability for a game in strategic form to a game in extensive form with perfect recall. We prove that if payoffs are generic then the outcomes of stable sets of equilibria defined via homological essentiality by Mertens coincide with those defined via homotopic...

We define a refinement of Nash equilibria called metastability. This refinement supposes that the given game might be embedded within any global game that leaves its local bestreply correspondence unaffected. A selected set of equilibria is metastable if it is robust against perturbations of...

This article characterizes a supply function equilibrium in an auction market constrained by limited capacities of links in a transportation network and limited input/output capacities of participants. The formulation is adapted to a wholesale spot market for electricity managed by the operator...

A player's pure strategy is called relevant for an outcome of a game in extensive form with perfect recall if there exists a weakly sequential equilibrium with that outcome for which the strategy is an optimal reply at every information set it does not exclude. The outcome satisfies forward...

Three axioms from decision theory select sets of Nash equilibria of signaling games in extensive form with generic payoffs. The axioms require undominated strategies (admissibility), inclusion of a sequential equilibrium (backward induction), and dependence only on the game's normal form even...

An N-player game can be approximated by adding a coordinator who interacts bilaterally with each player. The coordinator proposes strategies to the players, and his payoff is maximized when each player's optimal reply agrees with his proposal. When the feasible set of proposals is finite, a...

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...