eBay in the Sky: strategy-proof wireless spectrum auctions

Market-driven dynamic spectrum auctions can drastically improve the spectrum availability for wireless networks struggling to obtain additional spectrum. However, they face significant challenges due to the fear of market manipulation. A truthful or strategy-proof spectrum auction eliminates the fear by enforcing players to bid their true valuations of the spectrum. Hence bidders can avoid the expensive overhead of strategizing over others and the auctioneer can maximize its revenue by assigning spectrum to bidders who value it the most. Conventional truthful designs, however, either fail or become computationally intractable when applied to spectrum auctions. In this paper, we propose VERITAS, a truthful and computationally-efficient spectrum auction to support an eBay-like dynamic spectrum market. VERITAS makes an important contribution of maintaining truthfulness while maximizing spectrum utilization. We show analytically that VERITAS is truthful, efficient, and has a polynomial complexity of O(n3k) when n bidders compete for k spectrum bands. Simulation results show that VERITAS outperforms the extensions of conventional truthful designs by up to 200% in spectrum utilization. Finally, VERITAS supports diverse bidding formats and enables the auctioneer to reconfigure allocations for multiple market objectives.

[1]  Haitao Zheng,et al.  A General Framework for Wireless Spectrum Auctions , 2007, 2007 2nd IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks.

[2]  Elias Aravantinos,et al.  A new pricing model for next generation spectrum access , 2005, TAPAS '06.

[3]  I. Vogelsang,et al.  Handbook of telecommunications economics, volume I. structure, regulation & competition. Cave, M., Majumdar , 2010 .

[4]  Noam Nisan,et al.  Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.

[5]  Spectrum Auctions Spectrum Auctions , 2010 .

[6]  Koichi Yamazaki,et al.  A note on greedy algorithms for the maximum weighted independent set problem , 2003, Discret. Appl. Math..

[7]  N. Mandayam,et al.  Demand responsive pricing and competitive spectrum allocation via a spectrum server , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[8]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[9]  Subhash Suri,et al.  Approximately-strategyproof and tractable multi-unit auctions , 2003, EC '03.

[10]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[11]  M. Buddhikot,et al.  Spectrum management in coordinated dynamic spectrum access based cellular networks , 2005, First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005..

[12]  Michael L. Honig,et al.  Auction mechanisms for distributed spectrum sharing , 2004 .

[13]  E. H. Clarke Multipart pricing of public goods , 1971 .

[14]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[15]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[16]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.