Abstract
The goal of this chapter is to describe efficient auctions for multiple, indivisible objects in terms of the duality theory of linear programming. Because of its well-known incentive properties, we shall focus on Vickrey auctions. These are efficient auctions in which buyers pay the social opportunity cost of their purchases and consequently are rewarded with their (social) marginal product. We use the assignment model to frame our analysis.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call