Presentation 2009-09-25
Towards Approximation Algorithm on Large-scale Multi-Unit Combinatorial Auctions
Naoki FUKUTA, Takayuki ITO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Multi-unit combinatorial auction is an auction that has some items that can bee seen as indistinguishable. It can be applied for dynamic electricity auctions, pollutant production auctions, and various purposes. In this paper, we introduce approximation algorithms that are capable to handle multi-unit auctions directly, instead of transforming the auctions into single-unit auctions. We show that the proposed algorithms successfully produce good results for the problems that cannot be easily solved by ordinary LP solvers. Furthermore, the algorithms can be applied for single-unit combinatorial auctions that produce sufficient results compared to existing algorithms.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) multi agents / mechanism design / combinatorial auction
Paper # AI2009-14
Date of Issue

Conference Information
Committee AI
Conference Date 2009/9/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Towards Approximation Algorithm on Large-scale Multi-Unit Combinatorial Auctions
Sub Title (in English)
Keyword(1) multi agents
Keyword(2) mechanism design
Keyword(3) combinatorial auction
1st Author's Name Naoki FUKUTA
1st Author's Affiliation Faculty of Informatics, Shizuoka University()
2nd Author's Name Takayuki ITO
2nd Author's Affiliation Dept. of Computer Science, Nagoya Institute of Technology
Date 2009-09-25
Paper # AI2009-14
Volume (vol) vol.109
Number (no) 211
Page pp.pp.-
#Pages 6
Date of Issue