I extend Myersonʼs [R. Myerson, Optimal auction design, Math. Oper. Res. 6 (1981) 58–73] ironing technique to more general objective functions. The approach is based on a generalized notion of virtual surplus which can be maximized pointwise even when the monotonicity constraint implied by...

We study the sale of an indivisible good to liquidity constrained buyers: they cannot pay more than their “budget” regardless of their valuation. Both valuation and budget are private information. We derive the symmetric revenue maximizing and constrained efficient auctions in this setting....