We introduce a stochastic game in which transition probabilities depend on the history of the play, i.e., the players' past action choices. To solve this new type of game under the limiting average reward criterion, we determine the set of jointly-convergent pure-strategy rewards which can be...

This paper provides an in-depth study of the (most) refined best reply correspondence introduced by Balkenborg, Hofbauer, and Kuzmics (2012). An example demonstrates that this correspondence can be very different from the standard best reply correspondence. In two-player games, however, the...

We present attractiveness, a refinement criterion for evolutionary equilibria. Equilibria surviving this criterion are robust to small perturbations of the underlying payoff system or the dynamics at hand. Furthermore, certain attractive equilibria are equivalent to others for certain...

We show that in the canonical non-cooperative multilateral bargaining game, a subgame perfect equilibrium exists in pure stationary strategies, even when the space of feasible payoffs is not convex. At such an equilibrium there is no delay. We also have the converse result that randomization...

We examine contemporaneous perfect E-equilibria, in which a player's actions after every history, evaluated at the point of deviation from the equilibrium, must be within of a best E response. This concept implies, but is stronger than, Radner's ex ante perfect E-equilibrium. A strategy profile...

We examine contemporaneous perfect equilibria, in which a player's actions after every history, evaluated at the point of deviation from the equilibrium, must be within of a best response. This concept implies, but is not implied by Radner's ex ante perfect equilibrium. A strategy profile is a...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu,1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...

In repeated normal-form (simultaneous-move) games, simple penal codes (Abreu, 1986, 1988) permit an elegant characterization of the set of subgame-perfect outcomes. We show that the logic of simple penal codes fails in repeated extensive-form games. By means of examples, we identify two types of...