We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers' bids. In particular, we show that the k-th...

We study auctions of a single asset among symmetric bidders with affiliated values. We show that the second-price auction minimizes revenue among all efficient auction mechanisms in which only the winner pays, and the price only depends on the losers’ bids. In particular, we show that the k-th...

In auction and mechanism design, Myerson's classical regularity condition is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper introduces L-regularity as...

In mechanism design, Myerson regularity is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper therefore explores the quantitative version of Myerson...

It is well-known that the ability of the Vickrey-Clarke-Groves (VCG) mechanism to implement efficient outcomes for private value choice problems does not extend to interdependent value problems. When an agent's type affects other agents' utilities, it may not be incentive compatible for him to...

Bidding in first-price auctions crucially depends on the beliefs of the bidders about their competitors' willingness to pay. We analyze bidding behavior in a first-price auction in which the knowledge of the bidders about the distribution of their competitors' valuations is restricted to the...

I study a mechanism design problem of allocating a single good to an agent when the mechanism is followed by a post-mechanism game (aftermarket) played between the agent and a third-party. The aftermarket is beyond the direct control of the designer. However, she can influence the information...

Auctioneers who have an indivisible object for sale and believe that bidders are risk neutral can find the recipe for an optimal auction in Myerson (1981); auctioneers who believe that bidders are loss averse can find it here: An optimal auction is an all pay auction with minimum bid, and any...

In auction and mechanism design, Myerson's classical regularity condition is often too weak for a quantitative analysis of performance. For instance, ratios between revenue and welfare, or sales probabilities may vanish at the boundary of Myerson regularity. This paper introduces L-regularity as...