Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction
The simultaneous multiple-round auction (SMRA) and the combinatorial clock auction (CCA) are the two primary mechanisms used to sell bandwidth. Recently, it was shown that the CCA provides good welfare guarantees for general classes of valuation functions . This motivates the question of whether similar welfare guarantees hold for the SMRA in the case of general valuation functions.
We show the answer is no. But we prove that good welfare guarantees still arise if the degree of complementarities in the bidder valuations are bounded. In particular, if bidder valuations functions are \(\alpha \)-near-submodular then, under truthful bidding, the SMRA has a welfare ratio (the worst case ratio between the social welfare of the optimal allocation and the auction allocation) of at most \((1+\alpha )\). However, for \(\alpha >1\), this is a bicriteria guarantee, to obtain good welfare under truthful bidding requires relaxing individual rationality. We prove this bicriteria guarantee is asymptotically (almost) tight.
Finally, we examine what strategies are required to ensure individual rationality in the SMRA with general valuation functions. First, we provide a weak characterization, namely secure bidding, for individual rationality. We then show that if the bidders use a profit-maximizing secure bidding strategy the welfare ratio is at most \(1+\alpha \). Consequently, by bidding securely, it is possible to obtain the same welfare guarantees as truthful bidding without the loss of individual rationality.
KeywordsAscending auctions SMRA Welfare guarantee Individual rationality Near-submodular
- 1.Alkalay-Houlihan, C., Vetta, A.: False-name bidding and economic efficiency in combinatorial auctions. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI), pp. 2339–2347 (2014)Google Scholar
- 3.Ausubel, L., Cramton, P.: Auction Design for Wind Rights. Report to Bureau of Ocean Energy Management, Regulation and Enforcement (2011)Google Scholar
- 4.Ausubel, L., Cramton, P., Milgrom, P.: The clock-proxy auction: a practical combinatorial auction design. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, pp. 115–138. MIT Press, Cambridge (2006)Google Scholar
- 6.Boodaghians, S., Vetta, A.: The combinatorial world (of auctions) according to GARP. To appear in Proceedings of Symposium in Algorithmic Game Theory (SAGT) (2015)Google Scholar
- 7.Bousquet, N., Cai, Y., Hunkenschröder, C., Vetta, A.: On the economic efficiency of the combinatorial clock auction. arxiv, #1507.06495 (2015)Google Scholar
- 8.Bousquet, N., Cai, Y., Vetta, A.: Welfare and rationality guarantees for the simultaneous multiple-round ascending auction. arxiv, #1510.00295 (2015)Google Scholar
- 10.Cramton, P.: Simultaneous ascending auctions. In: Cramton, P., Shoham, Y., Steinberg, R. (eds.) Combinatorial Auctions, pp. 99–114. MIT Press, Cambridge (2006)Google Scholar
- 13.Fu, H., Kleinberg, R., Lavi, R.: Conditional equilibrium outcomes via ascending processes with applications to combinatorial auctions with item bidding. In: Proceedings of the Thirteenth Conference on Electronic Commerce (EC), p. 586 (2012)Google Scholar
- 20.McMillan, J.: Why auction the spectrum? Telecommun. Policy 3, 191–199 (1994)Google Scholar
Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.