Towards generic solver of combinatorial optimization problems with autonomous agents in P2P networks

Authors:
Shigeaki Tagashira;Masaya Mito;Satoshi Fujita
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University
Venue:
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Year:
2005

Citing 4
Cited 0

An efficient approximate algorithm for winner determination in combinatorial auctions

Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions

Artificial Intelligence
Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions

AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
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

This paper proposes a new class of parallel branch-and-bound (B&B) schemes. The main idea of the scheme is to focus on the functional parallelism instead of conventional data parallelism, and to support such a heterogeneous and irregular parallelism by using a collection of autonomous agents distributed over the network. After examining several implementation issues, we describe a detail of the prototype system implemented over eight PC's connected by a network. The result of experiments conducted over the prototype system indicates that the proposed parallel processing scheme significantly improves the performance of the underlying B&B scheme by adaptively switching exploring policies adopted by each agent participating to the problem solving.