Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation

Authors:
Naoki Fukuta;Takayuki Ito
Affiliations:
Shizuoka University, Hamamatsu, Japan 4328011;Nagoya Institute of Technology, Gokiso-cho, Japan 4668555
Venue:
Agent Computing and Multi-Agent Systems
Year:
2009

Citing 14
Cited 0

Towards a universal test suite for combinatorial auction algorithms

Proceedings of the 2nd ACM conference on Electronic commerce
An efficient approximate allocation algorithm for combinatorial auctions

Proceedings of the 3rd ACM conference on Electronic Commerce
Truth revelation in approximately efficient combinatorial auctions

Journal of the ACM (JACM)
Solving Combinatorial Auctions Using Stochastic Local Search

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions: A Survey

INFORMS Journal on Computing
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem

HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
ICE: an iterative combinatorial exchange

Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions

Combinatorial Auctions
Truthful and Near-Optimal Mechanism Design via Linear Programming

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An improved approximation algorithm for combinatorial auctions with submodular bidders

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Short-time approximation on combinatorial auctions: a comparison on approximated winner determination algorithms

Proceedings of the 3rd international workshop on Data enginering issues in E-commerce and services: In conjunction with ACM Conference on Electronic Commerce (EC '07)
Periodical Resource Allocation Using Approximated Combinatorial Auctions

IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 speeding up initial approximation performance. We show 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. Furthermore, our algorithms satisfy two desirable properties: WPM for final results and Weak-WPM for intermediate results.