Managing operations in multiagent virtual organizations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Managing operations in multiagent virtual organizations

Full text

Pdf (149 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents

Budapest, Hungary

SESSION: Social/organizational aspects table of contents

Pages 1309-1310

Year of Publication: 2009

ISBN:978-0-9817381-7-8

Authors

Shelley Zhang	University of Massachusetts, Dartmouth, North Dartmouth, MA
Ping Xuan	Clark University, Worcestor, MA
Bhumit Patel	University of Massachusetts, Dartmouth, North Dartmouth, MA

Sponsors

: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd

Publisher

International Foundation for Autonomous Agents and Multiagent Systems Richland, SC

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 24, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

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

ABSTRACT

In this paper we present our method and experimental results for handling virtual organization (VO) task management operations. First, we present a combinatorial auction approach to the initial commitment decision problem, which determines how a team task (i.e. VO task) can be allocated to a team of agents forming a virtual organization, while taking into consideration that the agents may be of different nature and they have other (their own) tasks in addition to the VO tasks. Then we present our solution to the crisis management problem, which determines at run time what to do when an agent decides to abandon a previously committed task in order to pursue a newly arrived, better task. We have built a testbed for evaluation of the strategies and used a building construction domain problem to show the effectiveness of our approach.

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	Q. Zheng, X. Zhang, "Automatic Formation and analysis of multi-agent Virtual organization". Journal of the Brazilian Computer Society (JCBS) Special Issue on agents Organizations, Vol. 11(1): 74--89, July, 2005.
	2	A Combinatorial Auction for Collaborative Planning, Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000), p.151, July 10-12, 2000
	3	Luke Hunsberger, Distributing the control of a temporal network among multiple agents, Proceedings of the second international joint conference on Autonomous agents and multiagent systems, July 14-18, 2003, Melbourne, Australia [doi>10.1145/860575.860720]
	4	L. Castillo, J. Fdez-Olivares, and A. Gonzalez, "A temporal constraint network based temporal planner". In Workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG 2002, pages 99--109, 2002.
	5	Tuomas Sandholm, An Algorithm for Optimal Winner Determination in Combinatorial Auctions, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.542-547, July 31-August 06, 1999
	6	Yuzo Fujishima , Kevin Leyton-Brown , Yoav Shoham, Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.548-553, July 31-August 06, 1999
	7	M. Ader, "Technologies for the Virtual Enterprise, Workflow&Groupware Strategies". France, 2001.
	8	M. T. Martinez, K. H. Fouletier, K. H. Park and J. Favrel, "Virtual enterprise-organization, evolution and control". International Journal of Production Economics. v74. 225--238. 2001.