Applying a combinatorial auction protocol to a coalition formation among agents in complex problems

Authors:
Hiromitsu Hattori;Tadachika Ozono;Toramatsu Shintani
Affiliations:
Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan;Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan;Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan
Venue:
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Year:
2003

Citing 2
Cited 1

Integer Programming for Combinatorial Auction Winner Determination

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

An adaptive attitude bidding strategy for agents in continuous double auctions

Electronic Commerce Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are trying to apply a combinatorial auction protocol to a coalition formation among agents to solve a scheduling problem that considers various constraints as a complex problem. Constraints on scheduling can be expressed as combinations of items (time slots). We formalize a combinatorial auction for scheduling as an MIP (Mixed Integer Programming) problem, which integrates the constraints on items and bids to express complex problems.