Download now Free registration required
In this paper, the authors 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, their goal is to design truthful mechanisms that will either maximize the social efficiency or maximize the revenue of the primary user. As the optimal conflictfree spectrum allocation problem is NP-hard, in this paper, they 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.
- Format: PDF
- Size: 178.97 KB