Fine-grained efficient resource allocation using approximated combinatorial auctions: A parallel greedy winner approximation for large-scale problems

Authors:
Naoki Fukuta;Takayuki Ito
Affiliations:
(Correspd. E-mail: fukuta@inf.shizuoka.ac.jp) Faculty of Informatics, Shizuoka University, 3 5 1 Johoku Hamamatsu, Shizuoka, Japan;(Visiting from Nagoya Institute of Technology, Japan) Center for Collective Intelligence, Sloan School of Management, Massachusetts Institute of Technology, 5 Cambridge Center, Cambridge MA 02142, ...
Venue:
Web Intelligence and Agent Systems
Year:
2009

Citing 34
Cited 5

Towards a universal test suite for combinatorial auction algorithms

Proceedings of the 2nd ACM conference on Electronic commerce
Competitive analysis of incentive compatible on-line auctions

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
Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Truth revelation in approximately efficient combinatorial auctions

Journal of the ACM (JACM)
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Sequential Auctions for the Allocation of Resources with Complementarities

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
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 and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers

Interfaces
On the Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions

WECWIS '02 Proceedings of the Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS'02)
Combinatorial Auctions: A Survey

INFORMS Journal on Computing
Adaptive Memory Allocations in Clusters to Handle Unexpectedly Large Data-Intensive Jobs

IEEE Transactions on Parallel and Distributed Systems
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
An Efficient Fault-Tolerant Distributed Channel Allocation Algorithm for Cellular Networks

IEEE Transactions on Mobile Computing
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
Node Cooperation in Hybrid Ad Hoc Networks

IEEE Transactions on Mobile Computing
Instantiating the contingent bids model of truthful interdependent value auctions

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
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
Mechanism design for multi-agent meeting scheduling

Web Intelligence and Agent Systems
Self-configuration protocols for P2P networks

Web Intelligence and Agent Systems
Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity

Proceedings of the 8th ACM conference on Electronic commerce
Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation

IEEE Transactions on Parallel and Distributed Systems
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)
Active Queue Management for Fair Resource Allocation in Wireless Networks

IEEE Transactions on Mobile Computing
A Noncooperative Game-Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access Networks

IEEE Transactions on Mobile Computing
Security-Aware Resource Allocation for Real-Time Parallel Jobs on Homogeneous and Heterogeneous Clusters

IEEE Transactions on Parallel and Distributed Systems
Optimal combinatorial electricity markets

Web Intelligence and Agent Systems
Sequential bundle-bid single-sale auction algorithms for decentralized control

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Toward a large scale E-market: a greedy and local search based winner determination

IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems

An experimental analysis of biased parallel greedy approximation for combinatorial auctions

International Journal of Intelligent Information and Database Systems
Toward a VCG-Like Approximate Mechanism for Large-Scale Multi-unit Combinatorial Auctions

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
An approach to sustainable electric power allocation using a multi-round multi-unit combinatorial auction

PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
A Preliminary Experimental Analysis on Combinatorial Auction-Based Electric Power Allocation for Manufacturing Industries

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Large-scale cooperative task distribution on peer-to-peer networks

Web Intelligence and Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on electronic markets and political strategies. Combinatorial auctions provide suitable mechanisms for efficient allocation of resources to self-interested attendees. On the other hand, efficient resource allocation is also becoming crucial in many computer systems that should manage resources efficiently. Considering ubiquitous computing scenarios, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Furthermore, to achieve such scenarios, it is very important to handle a large number of bids in an auction. In general, the optimal winner determination problem of a combinatorial auction is NP-hard. Thus, much work focuses on tackling the computational costs for winner determination. In this paper, we show that our approximation algorithms provide sufficient quality of winners for auctions that have a large number of bids on hard time constraints. Furthermore, we compare and discuss desirable properties of such approximation algorithms to be embedded in application systems.