The result of Colombo and Labrecciosa (2006) that optimal punishments are inferior to Nash-reversion trigger strategies with decreasing marginal costs is due to the output when a firm deviates from the punishment path being allowed to become negative.

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

Two players can make use of a trusted third party who mediates and partially resolves their conflict. Usually, the mediator should be aware of the situation and give suggestions to the players accordingly. However, a corrupt mediator can have a big influence on the outcome of the game. We single...

I consider the problem of assigning agents to indivisible objects, in which each agent pays a price for his object and all prices sum to a given constant. The objective is to select an assignment-price pair that is envy-free with respect to the agents' true preferences. I propose a simple...

I study a sequential first-price auction where two items are sold to two bidders with private binary valuations. A seller, prior to the second auction, can publicly disclose some information about the outcome of the first auction. I characterize equilibrium strategies for various disclosure...

We study repeated implementation in a model with overlapping generations of agents.It is assumed that the preferences of agents do not change during their lifetime.A social choice function selects an alternative in each period as a function of the preferences of agents who are alive in that...

We explore in an equilibrium framework whether games with multiple Nash equilibria are easier to play when players can communicate. We consider two variants, modelling talk about future plans and talk about past actions. The language from which messages are chosen is endogenous, messages are...

We prove that a social choice function is repeatedly implementable if and only if it is dynamically monotonic when the number of agents is at least three. We show how to test dynamic monotonicity by building an associated repeated game. It follows that a weaker version of Maskin monotonicity is...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...