This paper studies collusion in repeated auctions when bidders communicate prior to each stage auction. The paper presents a folk theorem for independent and correlated private signals and general interdependent values. Specifically, it identifies conditions under which an equilibrium collusion...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

Reputation systems constitute an important institution to help sustain trust in online auction markets. However, only half of buyers leave feedback after transactions, and nearly all of it is positive. In this paper, I propose a mechanism whereby sellers can provide rebates (not necessarily in...

I study optimal disclosure policies in sequential contests. A contest designer chooses at which periods to publicly disclose the efforts of previous contestants. I provide results for a wide range of possible objectives for the contest designer. While different objectives involve different...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

I study sequential contests where the efforts of earlier players may be disclosed to later players by nature or by design. The model has a range of applications, including rent seeking, R&D, oligopoly, public goods provision, and tragedy of the commons. I show that information about other...

We study competing-mechanism games under exclusive competition: principals first simultaneously post mechanisms, then agents simultaneously choose to participate and communicate with at most one principal. In this setting, which is common to competing-auction and competitive-search applications,...

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

This paper presents a unified framework for characterizing symmetric equilibrium in simultaneous move, two-player, rank-order contests with complete information, in which each player's strategy generates direct or indirect affine spillover effects that depend on the rank-order of her decision...

Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...