APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS

Naoki Fukuta, Takayuki Ito

2009

Abstract

In this paper, we propose approximated winner determination algorithms for iteratively conducted combinatorial auctions. Our algorithms are designed to effectively reuse last-cycle solutions to speed up the initial approximation performance on the next cycle. Experimental results show that our proposed algorithms outperform existing algorithms when a large number of similar bids are contained through iterations. Also, we propose an enhanced algorithm that effectively avoids the undesirable reuse of the last solutions in the algorithm without serious computational overheads.

Paper Citation

in Harvard Style

Fukuta N. and Ito T. (2009). APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS . In Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8111-66-1, pages 400-407. DOI: 10.5220/0001659104000407

in Bibtex Style

@conference{icaart09,
author={Naoki Fukuta and Takayuki Ito},
title={APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS},
booktitle={Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2009},
pages={400-407},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001659104000407},
isbn={978-989-8111-66-1},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - APPROXIMATED WINNER DETERMINATION FOR A SERIES OF COMBINATORIAL AUCTIONS
SN - 978-989-8111-66-1
AU - Fukuta N.
AU - Ito T.
PY - 2009
SP - 400
EP - 407
DO - 10.5220/0001659104000407