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

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

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

We show that the efficient allocation of production capacity can turn a competitive industry and downstream market into an imperfectly competitive one. Even though downstream firms have symmetric production technologies, the downstream industry structure will be symmetric only if capacity is...