The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions
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 0.632. This bound is asymptotically tight as the number of items sold tends to infinity.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.