This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decentralized Assignment Reasoning Using Collaborative Local Mediation
November 2006 (vol. 18 no. 11)
pp. 1576-1580
The collaborative linear assignment problem (CLAP) is a recent framework being developed to provide an intellectual basis for investigating uncluttered agent-based solutions for a fundamental class of combinatorial assignment (or allocation) applications. One key motivation of the research on CLAP is the hope that it can shed new light on adopting agent approaches for solving traditional combinatorial problems in general. To accommodate the various levels of control on agent sociability, typically different application-specific solutions to CLAP are required. In this paper, we take an architectural perspective, classifying solutions according to three typical control structures, namely, centralized, distributed, and decentralized. Existing work focuses mainly on centralized and distributed systems. In this paper, based on the Multi-Agent Assignment Algorithm ({\rm MA}^{3}) used for distributed systems, we propose a new mechanism for a totally decentralized architecture. This proposed mechanism incorporates a novel idea called collaborative Local Mediation (LM), therefore, we term this mechanism {\rm MA}^{3}{\hbox{-}}{\rm{LM}}. We prove that the decentralized {\rm MA}^{3}{\hbox{-}}{\rm{LM}} does not increase the worst-case reasoning complexity when compared to its partially decentralized counterpart. An example illustrates the new mechanism, with emphasis on how it performs collaborative local mediation.

[1] K.T. Seow and K.Y. How, “Collaborative Assignment: A Multiagent Negotiation Approach Using BDI Concepts,” Proc. First Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems (AAMAS '02), pp. 256-263, July 2002. extended version will appear as a 2006 Technical Report archived at the Inst. of Information Science, Academia Sinica, Taiwan.
[2] R.E. Burkard and E. Cela, “Linear Assignment Problems and Extensions,” Handbook of Combinatorial Optimization, Vol. 4, P.M. Pardalos and D.Z. Du, eds., pp. 75-149. Kluwer Academic, 1999.
[3] J.L. King, “Centralized Versus Decentralized Computing: Organizational Considerations and Management Options,” ACM Computing Survey, vol. 15, no. 4, pp. 319-349, 1983.
[4] J.S. Rosenschein and G. Zlotkin, Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers. The MIT Press, 1994.
[5] R. Mailler and V. Lesser, “Solving Distributed Constraint Optimization Problems Using Cooperative Mediation,” Proc. Third Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '04), pp. 438-445, July 2004.
[6] P. Davidsson and S. Johansson, “Evaluating Multi-Agent System Architectures: A Case Study Concerning Dynamic Resource Allocation,” Proc. Eng. Soc. in the Agents World III, Third Int'l Workshop (ESAW '02), P. Petta, R.Tolksdorf, and F. Zambonelli, eds., pp. 170-183, 2003.
[7] R. Jonker and A. Volgenant, “A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems,” Computing, vol. 38, pp.325-340, 1987.
[8] M.E. Bratman, D.J. Israel, and M. E. Pollack, “Plans and Resource-Bounded Practical Reasoning,” Computational Intelligence, vol. 4, no. 4, pp. 349-355, 1988.
[9] M.P. Georgeff and A.L. Lansky, “Reactive Reasoning and Planning,” Proc. Sixth Nat'l Conf. Artificial Intelligence (AAAI '87), pp. 677-682, July 1987.
[10] N.R. Jennings, P. Faratin, A.R. Lomuscio, S. Parsons, C. Sierra, and M. Wooldridge, “Automated Negotiation: Prospect, Methods and Challenges,” Int'l J. Group Decision and Negotiation, vol. 10, no. 2, pp. 199-215, 2001.
[11] T.W. Sandholm, “Contract Types for Satisficing Task Allocation: I Theoretical Results,” Proc. AAAI Spring Symp. Series: Satisficing Models, pp. 68-75, Mar. 1998.
[12] O. Shehory and S. Kraus, “Task Allocation via Coalition Formation Among Autonomous Agents,” Proc. 14th Int'l Joint Conf. Artificial Intelligence, pp.655-661, Aug. 1995.
[13] W.A. Shay, “Standards and Protocols in Data Communications,” Encyclopaedia of Information Systems, vol. 4, H. Bidgoli, ed., pp. 205-226. Academic Press, 2002.
[14] K.T. Seow and K.Y. How, “Collaborative Assignment: A Multiagent Negotiation Approach Using BDI Concepts,” Proc. First Int'l Joint Conf. Autonomous Agents and Multi-Agent Systems (AAMAS '02), pp. 256-263, July 2002.
[15] P.J. Modi, W.-M. Shen, M. Tambe, and M. Yokoo, “An Asynchronous Complete Method for Distributed Constraint Optimization,” Proc. Second Int'l Joint Conf. Autonomous Agents and Multiagent Systems (AAMAS '03). pp.161-168, July 2003.

Index Terms:
Intelligent agents, BDI negotiation model, collaborative linear assignment problem, local mediation, reasoning systems.
Citation:
Kiam Tian Seow, Kwang Mong Sim, "Decentralized Assignment Reasoning Using Collaborative Local Mediation," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 11, pp. 1576-1580, Nov. 2006, doi:10.1109/TKDE.2006.170
Usage of this product signifies your acceptance of the Terms of Use.