書誌事項
- タイトル別名
-
- Towards Approximated Short Cycle Reallocation on Combinatorial Auctions
この論文をさがす
抄録
In this paper, we propose enhanced approximation algorithms of combinatorial auction that are suitable for the purpose of periodical reallocation of items. Our algorithms are designed to effectively reuse the last solutions to speed up initial approximation performance. We present experimental results that show our proposed algorithms outperform existing algorithms in some aspects when the existing bids are not deleted. Also, we propose an enhanced algorithm that effectively avoids undesirable reuse of last solutions in the algorithm. This is especially effective when some existing bids are deleted from the last cycle.
収録刊行物
-
- コンピュータ ソフトウェア
-
コンピュータ ソフトウェア 25 (4), 208-225, 2008
日本ソフトウェア科学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282679713134336
-
- NII論文ID
- 130004892122
-
- NII書誌ID
- AN10075819
-
- HANDLE
- 10297/3639
-
- ISSN
- 02896540
-
- データソース種別
-
- JaLC
- IRDB
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可