The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions

07/20/2020 ∙ by Mete Şeref Ahunbay, et al. ∙ 0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.