Abstract
We study the efficiency of sequential multiunit auctions with two buyers and complete information. For general valuation functions, we show that the price of anarchy is exactly 1/T for auctions with T items for sale. For concave valuation functions, we show that the price of anarchy is bounded below by \(1-1/e\simeq 0.632\). This bound is asymptotically tight as the number of items sold tends to infinity.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have