An Efficient Winner Approximation for a Series of Combinatorial Auctions

In this paper, we show an analysis about 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 show an enhanced algorithm effectively avoids undesirable reuses of the last solutions in the algorithm without serious computational overheads.

[1]  Yoav Shoham,et al.  Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.

[2]  Takayuki Ito,et al.  Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions , 2008, PRIMA.

[3]  Shahar Dobzinski,et al.  An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.

[4]  Y. Shoham,et al.  Truth revelation in rapid, approximately efficient combinatorial auctions , 2001 .

[5]  Lachlan L. H. Andrew,et al.  Active Queue Management for Fair Resource Allocation in Wireless Networks , 2008, IEEE Transactions on Mobile Computing.

[6]  Takayuki Ito,et al.  Fine-grained efficient resource allocation using approximated combinatorial auctionsA parallel greedy winner approximation for large-scale problems , 2009, Web Intell. Agent Syst..

[7]  D. Lehmann,et al.  The Winner Determination Problem , 2003 .

[8]  Takayuki Ito,et al.  Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms , 2007, DEECS '07.

[9]  Noam Nisan,et al.  An efficient approximate allocation algorithm for combinatorial auctions , 2001, EC '01.

[10]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[11]  J. van Leeuwen,et al.  Intelligent Agents and Multi-Agent Systems , 2002, Lecture Notes in Computer Science.

[12]  Tuomas Sandholm,et al.  Expressive Commerce and Its Application to Sourcing , 2006, AAAI.

[13]  Chaitanya Swamy,et al.  Truthful and Near-Optimal Mechanism Design via Linear Programming , 2005, FOCS.

[14]  Xiao Qin,et al.  Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters , 2008, IEEE Transactions on Parallel and Distributed Systems.

[15]  Takayuki Ito,et al.  Periodical Resource Allocation Using Approximated Combinatorial Auctions , 2007, 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07).

[16]  Takayuki Ito,et al.  Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids , 2006, 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology.

[17]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[18]  David Levine,et al.  CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions , 2005, Manag. Sci..

[19]  William Drozd.  Automatically Defined Swarms for Task Allocation , 2007 .

[20]  Tuomas Sandholm.  Expressive Commerce and Its Application to Sourcing: How We Conducted $35 Billion of Generalized Combinatorial Auctions , 2007, AI Mag..

[21]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[22]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[23]  Sven Koenig,et al.  Sequential Bundle-Bid Single-Sale Auction Algorithms for Decentralized Control , 2007, IJCAI.

[24]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.

[25]  Yi Zhu,et al.  A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[26]  Craig Boutilier,et al.  Sequential Auctions for the Allocation of Resources with Complementarities , 1999, IJCAI.

[27]  Jyh-Charn Liu,et al.  On the efficient scheduling of non-periodic tasks in hard real-time systems , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[28]  Takayuki Ito,et al.  Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation , 2009, PRIMA.

[29]  David C. Parkes,et al.  ICE: an iterative combinatorial exchange , 2005, EC '05.