Paper Info
Title
Near-optimal truthful spectrum auction mechanisms with spatial and temporal reuse in wireless networks
Abstract
In this work, we study spectrum auction problem where each spectrum usage request has spatial, temporal, and spectral features. After receiving bid requests from secondary users, and possibly reserve price from primary users, our goal is to design truthful mechanisms that will either optimize the social efficiency or optimize the revenue of the primary user. As computing an optimal conflict-free spectrum allocation is an NP-hard problem, in this work, we design near optimal spectrum allocation mechanisms separately based on the techniques: derandomized allocation from integer programming formulation, and its linear programming (LP) relaxation. We theoretically prove that 1) our derandomized allocation methods are monotone, thus, implying truthful auction mechanisms; 2) our derandomized allocation methods can achieve a social efficiency or a revenue that is at least $1-\frac{1}{e}$ times of the optimal respectively; Our extensive simulation results corroborate our theoretical analysis.
Year
DOI
Venue
2013
10.1145/2491288.2491313
MobiHoc
Keywords
Field
DocType
spectrum usage request,derandomized allocation,wireless network,integer programming formulation,primary user,social efficiency,spectrum auction problem,optimal spectrum allocation mechanism,temporal reuse,np-hard problem,near-optimal truthful spectrum auction,derandomized allocation method,optimal conflict-free spectrum allocation,revenue,spectrum auction
Wireless network,Mathematical economics,Mathematical optimization,Reservation price,Computer science,Auction theory,Integer programming,Linear programming,Frequency allocation,Spectrum auction,Revenue equivalence,Distributed computing
Conference
Citations 
PageRank 
References 
6
0.46
8
Authors
6
Name
Order
Citations
PageRank
He Huang17918.92
Yu-E Sun2679.60
Xiang-Yang Li36855435.18
Zhili Chen4235.90
Wei Yang5122.32
Hongli Xu650285.92