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

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

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

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

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

A simple auction-theoretic framework is used to examine symmetric litigation environments where the legal ownership of a disputed asset is unknown to the court. The court observes only the quality of the case presented by each party, and awards the asset to the party presenting the best case....

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

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 develops one possible argument why auctioning licenses to op- erate in an aftermarket may lead to higher prices in the aftermarket compared to a more random allocation mechanism. Key ingredients in the argument are differences in firms' risk attitudes and the fact that future market...