Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies

Information Sciences

Volumn 178, Issue 4, 2008, Pages 1110-1132

  Seow, Kiam Tian ^a   Sim, Kwang Mong ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Belief desire intention (BDI) negotiation model; Collaborative linear assignment; Distributed problem solving; Reasoning control

Indexed keywords

ALGORITHMS; BAYESIAN NETWORKS; FUNCTION EVALUATION; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION;

BELIEF-DESIRE-INTENTION (BDI) NEGOTIATION MODEL; COLLABORATIVE LINEAR ASSIGNMENT; DISTRIBUTED PROBLEM SOLVING; REASONING CONTROL;

COMPUTER SUPPORTED COOPERATIVE WORK;

EID: 36549065270     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.09.024     Document Type: Article

References (40)

1. Akgul M. A genuinely polynomial primal simplex algorithm for the assignment problem. Discrete Applied Mathematics 45 (1993) 93-115
2. Archibald J.K., Hill J.C., Johnson F.R., and Stirling W.C. Satisficing negotiations. IEEE Transactions on Systems, Man and Cybernetics: Part C 36 1 (2006) 4-18
3. Baraglia R., Hidalgo J.I., and Perego R. A hybrid heuristic for the travelling salesman problem. IEEE Transactions on Evolutionary Computation 5 6 (2001) 613-622
4. Bertsekas D.P. The auction algorithm: a distributed relaxation method for the assignment problem. Annals of Operations Research 14 (1988) 105-123
5. C. Boutilier, M. Goldszmidt, B. Sabata, Sequential auctions for the allocation of resources with complementarities, in: Proceedings of the 8th International Joint Conference on Artificial Intelligence, 1999, pp. 527-534.
6. Bratman M.E. Intentions, Plans and Practical Reason (1987), Harvard University Press, Cambridge, MA
7. Bratman M.E., Israel D.J., and Pollack M.E. Plans and resource-bounded practical reasoning. Computational Intelligence 4 4 (1988) 349-355
8. Burgeios F., and Lassalle J.C. An extension of the Munkres algorithm for the assignment problem to rectangular matrices. Communications of the ACM 14 (1971) 802-806
9. Burkard R.E., and Cela E. Linear assignment problems and extensions. In: Pardalos P.M., and Du D.Z. (Eds). Handbook of Combinatorial Optimization vol. 4 (1999), Kluwer Academic Publishers, Dordrecht, The Netherlands 75-149
10. A. Chavez, P. Maes, Kasbah: an agent marketplace for buying and selling goods, in: Proceedings of the First International Conference on Practical Application of Intelligent Agents and Multi-Agent Technology, London, UK, April 1996, pp. 75-90.
11. Chevaleyre Y., Dunne P.E., Endriss U., Lang J., Lemaitre M., Maudet N., Padget J., Phelps S., Rodriguez-Aguilar J.A., and Sousa P. Issues in multiagent resource allocation. Informatica 30 1 (2006) 3-31
12. Croes G.A. A method for solving traveling-salesman problems. Operations Research 6 6 (1958) 791-812
13. Ford L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press, Princeton, NJ
14. M.P. Georgeff, A.L. Lansky, Reactive reasoning and planning, in: Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI'87), Seattle, WA, USA, July 1987, pp. 677-682.
15. M.P. Georgeff, B. Pell, M.E. Pollack, M. Tambe, M. Wooldridge, The Belief-Desire-Intention model of agency, in: J.P. Müller, A.S.R. Munindar Singh (Eds.), Intelligent Agents V: Agent Theories, Architectures, and Languages (ATAL): Proceedings of the 5th International Workshop, ATAL'98. Springer, London, UK, Paris, France, July 1998, pp. 1-10.
16. T.D. Gottschalk, Concurrent implementation of Munkres algorithm, in: Proceedings of the Fifth IEEE International Conference on Distributed Memory Computing, 1990, pp. 52-57.
17. Jennings N.R., Faratin P., Lomuscio A.R., Parsons S., Sierra C., and Wooldridge M. Automated negotiation: prospect, methods and challenges. International Journal of Group Decision and Negotiation 10 2 (2001) 199-215
18. Jonker R., and Volgenant A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38 (1987) 325-340
19. Jung H., Tambe M., and Kulkarni S. Argumentation as distributed constraint satisfaction: applications and results. Proceedings of the Fifth International Conference on Autonomous Agents (2001), ACM Press, Montreal, Quebec, Canada 324-331
20. Kraus S. Beliefs, time and incomplete information in multiple encounter negotiations among autonomous agents. Annals of Mathematics and Artificial Intelligence 20 1-4 (1997) 111-159
21. Kraus S., Sycara K., and Evenchik A. Reaching agreements through argumentation: a logical model and implementation. Artificial Intelligence 104 1-2 (1998) 1-69
22. Kraus S., Wilkenfeld J., and Zlotkin G. Multiagent negotiation under time constraints. Artificial Intelligence 75 2 (1995) 297-345
23. Kuhn H.W. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2 (1955) 83-97
24. S.D. Ramchurn, C. Sierra, L. Godo, N.R. Jennings, Negotiating using rewards, in: Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'06), ACM Press, Hakodate, Japan, July 2006, pp. 400-407.
25. Rosenschein J.S., and Zlotkin G. Designing conventions for automated negotiation. AI Magazine 15 3 (1994) 29-46
26. Rosenschein J.S., and Zlotkin G. Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers (1994), MIT Press, Cambridge, MA
27. T.W. Sandholm, Contract types for satisficing task allocation: I theoretical results, in: Proceedings of AAAI Spring Symposium Series: Satisficing Models, Sanford University, Stanford, CA, USA, 1998, pp. 68-75.
28. K.T. Seow, K.Y. How, Collaborative assignment: a multiagent negotiation approach using BDI concepts, in: Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'02), ACM Press, Palazzo Re Enzo, Bologna, Italy, July 2002, pp. 256-263.
29. Seow K.T., and Sim K.M. Decentralized assignment reasoning using collaborative local mediation. IEEE Transactions on Knowledge and Data Engineering 18 11 (2006) 1576-1580
30. Seow K.T., Sim K.M., and Kwek Y.C. Coalition formation for resource co-allocation using BDI assignment agents. IEEE Transactions on Systems, Man and Cybernetics: Part C 37 4 (2007) 682-693
31. O. Shehory, S. Kraus, Task allocation via coalition formation among autonomous agents, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Canada, August 1995, pp. 655-661.
32. Shih D.-H., Huang H.-Y., and Yen D.C. A secure reverse vickrey auction scheme with bid privacy. Information Sciences 176 5 (2006) 550-564
33. C. Sierra, N.R. Jennings, P. Noriega, S. Parsons, A framework for argumentation-based negotiation, in: Proceedings of the Fourth International Workshop on Agent Theories, Architectures and Languages, Rhode Island, USA, 1997, pp. 167-182.
34. Støroy S., and Sørevik T. Massively parallel augmenting path algorithms for the assignment problem. Computing 59 1 (1997) 1-16
35. Toroslu I.H., and Arslanoglu Y. Genetic algorithm for the personnel assignment problem with multiple objectives. Information Sciences 177 3 (2007) 787-803
36. Toroslu I.H., and Ucoluk G. Incremental assignment problem. Information Sciences 177 6 (2007) 1523-1529
37. Weiss G. Multiagent System: A Modern Approach to Distributed Artificial Intelligence (1999), MIT Press, London
38. Yokoo M., Durfee E.H., Ishida T., and Kuwabara K. The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10 5 (1998) 673-685
39. M. Yokoo, K. Hirayama, Distributed constraint satisfaction algorithm for complex local problems, in: Proceedings of the Third International Conference on Multiagent Systems (ICMAS-98), 1998, pp. 372-379.
40. Zlotkin G., and Rosenschein J.S. Mechanism design for automated negotiation, and its application to task oriented domains. Artificial Intelligence 86 2 (1996) 195-244