We investigate the scope for cooperation within a community engaged in repeated reciprocal interactions. Players seek the help of others and approach them sequentially according to some fixed order, that is, a ranking profile. We study the ranking profiles that are most effective in sustaining...

We examine the consequences of vote buying, assuming this practice were allowed and free of stigma. Two parties competing in a binary election may purchase votes in a sequential bidding game via up-front binding payments and/or campaign promises (platforms) that are contingent upon the outcome...

Using techniques from evolutionary game theory, we analyze potential games with continuous player sets, a class of games which includes a general model of network congestion as a special case. We concisely characterize both the complete set of Nash equilibria and the set of equilibria which are...

In games in which multiple principals contract simultaneously and non-cooperatively with the same agent, standard direct revelation mechanisms in which the agent reports his type(i.e. his exogenous private information) have been proven inadequate to characterize the entire set of equilibrium...

Since campaign finance reform is usually motivated by the concern that existing legislation can not effectively prevent campaign contributions to ‘buy favors’, this paper assumes that contributions influence political decisions. But, given that it is also widely recognized that interest...

A strategy profile in a repeated game has bounded recall L if play under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public...

We consider equilibrium selection in 2x2 bimatrix games with two strict Nash equilibria in a random matching framework. The players seek to maximize the discounted payoffs, but are restricted to make a short run commitment. Modeling the friction this way yields equilibrium dynamics of the...

We consider a dynamic auction problem motivated by the traditional single-leg, multi-period revenue management problem. A seller with C units to sell faces potential buyers with unit demand who arrive and depart over the course of T time periods. The time at which a buyer arrives, her value for...

We study the location equilibrium in Hotelling's model of spatial competition. As d'Aspremont et al. (1979) have shown, with quadratic consumer transportation cost the two sellers will seek to move as far away from each other as possible. This generates a coordination problem which the...

Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite two-player game where each player can base their strategy on the other player's strategies. Tennenholtz's model allowed each player to produce a "loop-free" computer program that had access to the code for both...