Publication:
Testing BOI and BOB algorithms for solving the Winner Determination

Thumbnail Image
Identifiers
URI: https://hdl.handle.net/10016/4052
ISBN: 978-0-7695-3326-1
DOI: 10.1109/HIS.2008.21
Files
testing_HIS_2008.pdf (351.43 KB)
Publication date
2008-09
Defense date
Authors
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE
Impact
Google Scholar
Export
Research Projects
Organizational Units
Journal Issue
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.
Description
Eighth International Conference on Hybrid Intelligent Systems, 2008. HIS '08. Barcelona, 10-12 September 2008
Keywords
Bibliographic citation
Eighth International Conference on Hybrid Intelligent Systems, 2008 : HIS '08. p.732-737
Collections
DI - GCERN - Comunicaciones en Congresos y otros eventos
DI - GCERN - Capítulos de Monografías