In the context of repeated first-price auctions, we explore how a bid-rigging cartel can simultaneously overcome the difficulty of soliciting truthful private information about valuations and the difficulty of enforcing its internal mechanism. Focusing on the class of trigger-strategy collusive...

This paper develops a framework for studying repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers) in every period. I define history-dependent and...

We study large-population repeated games where players are symmetric but not anonymous, so player-specific rewards and punishments are feasible. Players may be commitment types who always take the same action. Even though players are not anonymous, we show that an anti-folk theorem holds when...

This paper departs from the standard profit-maximizing model of firm behavior by assuming that firms are motivated in part by personal animosity-or respect-towards their competitors. A reciprocal firm responds to unkind behavior of rivals with unkind actions (negative reciprocity), while at the...

This paper investigates how the introduction of social preferences affects players' equilibrium behavior in both the one-shot and the infinitely repeated version of the Prisoner's Dilemma game. We show that fairness concerns operate as a 'substitute' for time discounting in the infinitely...

This paper studies a repeated play of a family of games by resource-constrained players. To economize on reasoning resources, the family of games is partitioned into subsets of games which players do not distinguish. An example is constructed to show that when games are played a finite number of...

We study a class of chip strategies in repeated games of incomplete information. This class generalizes the strategies studied by Möbius (2001) in the context of a favor-exchange model and the strategies studied in our companion paper Olszewski and Safronov (2017). In two-player games, if...

We study chip-strategy equilibria in two-player repeated games. Intuitively, in these equilibria players exchange favors by taking individually suboptimal actions if these actions create a "gain" for the opponent larger than the player's "loss" from taking them. In exchange, the player who...

We study the repeated implementation of social choice functions in environments with complete information and changing preferences. We define dynamic monotonicity, a natural but nontrivial dynamic extension of Maskin monotonicity, and show that it is necessary and almost sufficient for repeated...

We provide a simple sufficient condition for the existence of a recursive upper bound on (the Pareto frontier of) the sequential equilibrium payoff set at a fixed discount factor in two-player repeated games with imperfect private monitoring. The bounding set is the sequential equilibrium payoff...