Toward a large scale E-market: a greedy and local search based winner determination

Authors:
Naoki Fukuta;Takayuki Ito
Affiliations:
Faculty of Informatics, Shizuoka University, Hamamatsu, Shizuoka, Japan;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Japan
Venue:
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Year:
2007

Citing 11
Cited 4

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
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
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

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)
Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions

PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Fine-grained efficient resource allocation using approximated combinatorial auctions: A parallel greedy winner approximation for large-scale problems

Web Intelligence and Agent Systems
An experimental analysis of biased parallel greedy approximation for combinatorial auctions

International Journal of Intelligent Information and Database Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial auction is one of the most popular market mechanisms and it has a huge effect on electronic markets and political strategies. On large scale e-markets, we need a good approximation algorithm for winner determination that is robust for changing the distribution and the number of bids in an auction. We proposed approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we show the robustness of our winner determination algorithms for combinatorial auctions with large number of bids. Experimental results demonstrate that our proposed algorithms are robust on changing the distribution and the number of bids in an auction. Finally, we shortly describe a theoretical limitation about our algorithms that concerns with giving truthfulness of the auction mechanism.