Testing BOI and BOB Algorithms for Solving the Winner Determination Problem in Radio Spectrum Auctions

Authors:
Y. Saez;A. Mochon;J. L. Gomez-Barroso;P. Isasi
Affiliations:
-;-;-;-
Venue:
HIS '08 Proceedings of the 2008 8th International Conference on Hybrid Intelligent Systems
Year:
2008

Citing 0
Cited 4

Testing bidding strategies in the clock-proxy auction for selling radio spectrum: a genetic algorithm approach

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
The importance of the size of the digital dividend when digital dividend spectrum is auctioned

International Journal of Mobile Communications
The Clock Proxy Auction for Allocating Radio Spectrum Licenses

Computational Economics
Simulating digital dividend auctions: Service neutrality versus dedicated licences

Telematics and Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial auctions are a promising auction format for allocating radio spectrum, as well as other goods. An important handicap of combinatorial auctions is determining the winner bids among many options, that is, solving the winner determination problem (WDP). This paper tackles this computational problem using two approaches in a combinatorial first-price sealed bid auction. The first one, is an A* based on items (BOI). The second one, is an A* based on bids (BOB). These two techniques are tested in several scenarios for allocating radio spectrum licenses. The results obtained reveal that the search algorithm A* with the BOB formulation outperforms the other and always finds the optimal solution very quickly.