I consider a seller selling a good to bidders with two-dimensional private information: their valuation for a good and their characteristic. While valuations are non-verifiable, characteristics are partially verifiable and convey information about the distribution of a bidder’s valuation. I...

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

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

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 consider a seller selling a good to bidders with two-dimensional private information: their valuation for a good and their characteristic. While valuations are non-verifiable, characteristics are partially verifiable and convey information about the distribution of a bidder's valuation. I...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by observable quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal...

We present a new dynamic auction for procurement problems where payments are bounded by a hard budget constraint and money does not enter the procurer's objective function.