Task allocation via coalition formation among autonomous agents

作者: Onn Shehory , Sarit Kraus

DOI:

关键词:

摘要: Autonomous agents working in multi-agent environments may need to cooperate order fulfill tasks. Given a set of and tasks which they have satisfy, we consider situations where each task should be attached group will perform the task. The allocation groups is necessary when cannot performed by single agent. It also useful assign group's performance more efficient than agents. In this paper give an solution problem among autonomous agents, suggest that form coalitions or improve efficiency. We present distributed algorithm with low ratio bound computational complexity. Our any-time algorithm, it simple, easy implement.

参考文章(20)
Jonathan Wilkenfeld, Sarit Kraus, Negotiations over time in a multi-agent environment preliminary report international joint conference on artificial intelligence. pp. 56- 61 ,(1991)
Tuomas Sandholm, An implementation of the contract net protocol based on marginal cost calculations national conference on artificial intelligence. pp. 256- 262 ,(1993)
Steven Ketchpel, Forming coalitions in the face of uncertain rewards national conference on artificial intelligence. pp. 414- 419 ,(1994)
Lloyd S. Shapley, A Value for n-person Games Contributions to the Theory of Games. pp. 307- 317 ,(1952) , 10.1017/CBO9780511528446.003
Onn Shehory, Sarit Kraus, Coalition Formation Among Autonomous Agents: Strategies and Complexity. MAAMAW. pp. 56- 72 ,(1993)
Eric Werner, Toward a Theory of Communication and Cooperation for Multiagent Planning theoretical aspects of rationality and knowledge. pp. 129- 143 ,(1988)
Nicos Christofides, S. Korman, Note—A Computational Survey of Methods for the Set Covering Problem Management Science. ,vol. 21, pp. 591- 599 ,(1975) , 10.1287/MNSC.21.5.591
Howard Raiffa, R. Duncan Luce, T. Teichmann, Games and decisions ,(1957)