I investigate the design of effort-maximizing mechanisms when agents have both private information and convex effort costs, and the designer has a fixed prize budget. I first demonstrate that it is always optimal for the designer to utilize a contest with as many participants as possible....

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

This paper studies the optimal mechanisms for a seller with imperfect commitment who puts up for sale one individual unit per period to a single buyer in a dynamic game. The buyer's willingness to pay remains constant over time and is his private information. In this setting, the seller cannot...