This paper studies markets plagued with asymmetric information on the quality of traded goods. In Akerlof's setting, sellers are better informed than buyers. In contrast, we examine cases where buyers are better informed than sellers. This creates an inverse adverse selection problem: The market...

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

In this note, we experimentally examine the relative performance of price-only auctions and multi-attribute auctions. We do so in procurement settings where the buyer can give the winning bidder incentives to exert effort on non-price dimensions after the auction. Both auctions theoretically...

There is by now a large literature arguing that auctions with a variety of after-market interactions may not yield an efficient allocation of the objects for sale, especially when the bidders impose strong negative externalities upon each other. This paper argues that these inefficiencies can be...

We experimentally examine the effectiveness of a leniency program against bidding rings in two commonly used auctions: the English auction (EN) and the first-price sealed-bid auction (FPSB). Our results show that the leniency program does not affect the average winning bid, nor the average...

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

This paper characterizes the optimal first-price auction (FPA) and second-price auction (SPA) for selling rights, contracts, or licenses that involve ensuing payoff uncertainty for the winning bidder. The distribution of the random payoff is common knowledge, except that bidders have private...

We study auctions in which the number of potential bidders is large, such as in Internet auctions. With numerous bidders, the expected revenue and the optimal bid function in a first price auction result in complicated expressions, except for a few simple distribution function for the bidders'...

Internet auctions attract numerous agents, but only a few become active bidders. A major difficulty in the structural analysis of internet auctions is that the number of potential bidders is unknown. Under the independent private value paradigm (IPVP)the valuations of the active bidders form a...