We analyze a repeated first-price auction in which the types of the players are determined before the first round. It is proved that if every player is using either a belief-based learning scheme with bounded recall or a generalized fictitious play learning scheme, then for sufficiently large...

Exploiting small uncertainties on the part of opponents, players in long, finitely repeated games can maintain false reputations that lead to a large variety of equilibrium outcomes. Even cooperation in a finitely repeated prisoners' dilemma is obtainable. Can such false reputations be...

A profit-maximizing auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group, only if the sum of their bids exceeds a reserve...

Folk Theorems in repeated games hold fixed the game payoffs, while the discount factor is varied freely. We show that these results may be sensitive to the order of limits in situations where players move asynchronously. Specifically, we show that when moves are asynchronous, then for a fixed...

This paper examines the issue of multiplicity of equilibria in alternating move repeated games with two players. Such games are canonical models of environments with repeated, asynchronous choices due to inertia or replacement. We focus our attention on Markov Perfect equilibria (MPE). These are...

In a recent paper Bagwell (1995) pointed out that only the Cournot outcome, but not the Stackelberg outcome, can be supported by a pure Nash equilibrium when actions of the Stackelberg leader are observed with the slightest error. The Stackelberg outcome, however, remains close to the outcome of...

This paper examines Markov Perfect equilibria of general, finite state stochastic games. Our main result is that the number of such equilibria is finite for a set of stochastic game payoffs with full Lebesgue measure. We further discuss extensions to lower dimensional stochastic games like the...

This paper studies the role of memory and communication in games between ongoing organizations. In each organization, each individual, upon entry into the game, replaces his predecessor who has the same preferences and faces the same strategic possibilities. Entry across distinct organizations...

(less than 25 lines) I prove the subgame-perfect equivalent of the basic result for Nash equilibria in normal-form games of strategic complements: the set of subgame-perfect equilibria is a non-empty, complete lattice. For this purpose I introduce a device that allows the study of the set of...

We analyze the problem of coordinating upon asymmetric equilibria in a symmetric game, such as the battle-of-the-sexes. In repeated interaction, asymmetric coordination is possible possible via symmetric repeated game strategies. This requires that players randomize initially and adopt a...