BOB: improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence
A first look at traffic on smartphones
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
| Hi-index | 0.00 |
The purpose of this paper is to propose a flexible spectrum auction that supports highly expressive bids. Essentially an expressive bid means that a bidder can ask for what they really want rather than select from a limited set of options. The paper presents a combinatorial auction that enables; variable, continuous, bidder defined, bandwidth offerings; variable, bidder defined, allocations of paired (FDD) and unpaired (TDD) spectrum; FDD assignments subject to a minimal, not absolute duplex gaps; and, variable, bidder defined, asymmetric FDD assignments. Bidders can request spectrum in OR, AND and XOR combinations. This results in an auction process that effectively allows bidders play a role both in the allocation and assignment process. Results are presented which show this type of auction leads to highly efficient use of spectral resources. In addition it is in keeping with more dynamic approaches which recognize that we are in a world of rapidly advancing technologies.