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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (109 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of the second international joint conference on Autonomous agents and multiagent systems table of contents

Melbourne, Australia

POSTER SESSION: Posters table of contents

Pages: 1008 - 1009

Year of Publication: 2003

ISBN:1-58113-683-8

Authors

Hiromitsu Hattori	Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan
Tadachika Ozono	Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan
Toramatsu Shintani	Nagoya Institute of Technology, Gokiso-cho,Showa-ku, Nagoya, Aichi,Japan

Sponsors

SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 11, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/860575.860769 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Integer Programming for Combinatorial Auction Winner Determination, Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000), p.39, July 10-12, 2000
	2	W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 607--613, 1995.