Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
We study the efficiency of first-/second-price sequential multiunit auctions with two buyers and complete information. Extending the primal-dual framework for obtaining efficiency bounds to this sequential setting, we obtain tight price of anarchy bounds. 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.
ACM Transactions on Economics and Computation – Association for Computing Machinery
Published: Jun 24, 2023
Keywords: Sequential auctions
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.