Title :
Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids
Author :
Fukuta, Naoki ; Ito, Takayuki
Author_Institution :
Fac. of Inf., Shizuoka Univ., Shizuoka
Abstract :
We propose new approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we focus on a more practical approximated algorithm in the context of revenue maximization. We propose a hill-climbing greedy algorithm, a SA-like random search algorithm, and their enhancement for searching multiple key parameter values. The experimental results demonstrate that our algorithms perform approximately 0.997 optimality compared with the optimal solutions and better than previously presented approximated algorithms. We also demonstrate that our algorithms are a kind of anytime algorithm that bring better results in shorter computational time that can be applied to large and dynamic electronic markets.
Keywords :
approximation theory; combinatorial mathematics; commerce; greedy algorithms; search problems; SA-like random search; approximation algorithm; combinatorial auctions; hill-climbing greedy algorithm; revenue maximization; winner determination; Approximation algorithms; Computational complexity; Computer science; Consumer electronics; Greedy algorithms; Indium tin oxide; Informatics; Simulated annealing; Sorting; Temperature;
Conference_Titel :
Intelligent Agent Technology, 2006. IAT '06. IEEE/WIC/ACM International Conference on
Conference_Location :
Hong Kong
Print_ISBN :
0-7695-2748-5
DOI :
10.1109/IAT.2006.123