Testing BOI and BOB algorithms for solving the Winner Determination

Autor:	Sáez Achaerandio, Yago, Mochón, Asunción, Gómez-Barroso, J.L., Isasi, Pedro
Rok vydání:	2008
Předmět:	Informática Radio spectrum TheoryofComputation_GENERAL Winner determination problem Combinatorial auctions
Zdroj:	e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid instname
Popis:	Eighth International Conference on Hybrid Intelligent Systems, 2008. HIS '08. Barcelona, 10-12 September 2008 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5ed001476b1753fd6c847557bb91f3ef http://hdl.handle.net/10016/4052 Zobrazit plný text záznamu