We define the class of two-player zero-sum games with payoffs having mild discontinuities, which in applications typically stem from how ties are resolved. For games in this class we establish sufficient conditions for existence of a value of the game and minimax or Nash equilibrium strategies...

We apply three axioms adapted from decision theory to refinements of the Nash equilibria of games with perfect recall that select connected closed sub- sets called solutions. No player uses a weakly dominated strategy in an equilibrium in a solution. Each solution contains a quasi-perfect...

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

For an all-pay sealed-bid auction of an item for which each bidder's realized value can depend on every bidder's privately observed signal, existence of equilibria in behavioral strategies is established using only the assumption that bidders' value functions and the density function of signals...

A first-price sealed-bid auction of an item for which bidders are risk-neutral and have privately known values is shown to have an equilibrium in mixed behavioral strategies if the joint distribution of bidders' values has a continuous density on a cubical support. Such an equilibrium has...

For two symmetric bidders, weak monotonicity conditions are shown to imply existence of an equilibrium in mixed behavioral strategies for a sealed-bid first-price auction of an item for which each bidder's value depends on every bidder's observed signal. Such an equilibrium has atomless...

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

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