Name
Abstract | ||
|---|---|---|
In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design truthful mechanisms that will either maximize the social efficiency or maximize the revenue of the primary user. As the optimal conflict-free spectrum allocation problem is NP-hard, in this work, we design near optimal spectrum allocation mechanisms separately based on the following techniques: derandomized allocation from integer programming formulation, its linear programming (LP) relaxation, and the dual of the LP. We theoretically prove that 1) our near optimal allocation methods are bid monotone, which implys truthful auction mechanisms; and 2) our near optimal allocation methods can achieve a social efficiency or a revenue that is at least $1-\frac{1}{e}$ times of the optimal respectively. At last, we conduct extensive simulations to study the performances (social efficiency, revenue) of the proposed methods, and the simulation results corroborate our theoretical analysis. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Revenue,Mathematical optimization,Reservation price,Computer science,Integer programming,Linear programming,Frequency allocation,Spectrum auction,Revenue equivalence,Monotone polygon |
DocType | Volume | Citations |
Journal | abs/1305.6390 | 2 |
PageRank | References | Authors |
0.40 | 15 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu-e Sun | 1 | 3 | 0.75 |
| He Huang | 2 | 79 | 18.92 |
| Xiang-Yang Li | 3 | 6855 | 435.18 |
| Zhili Chen | 4 | 10 | 1.74 |
| Wei Yang | 5 | 12 | 2.32 |
| Hongli Xu | 6 | 502 | 85.92 |
| Liusheng Huang | 7 | 1082 | 123.52 |