Hyuckchul Jung
ABSTRACT
Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is an effective approach to resolve conflicts. Indeed, we are applying argumentation in some real-world multi-agent applications. However, a key problem in such applications is that a well-understood computational model of argumentation is currently missing, making it difficult to investigate convergence and scalability of argumentation techniques, and to understand and characterize different collaborative NVA strategies in a principled manner. To alleviate these difficulties, we present distributed constraint satisfaction problem (DCSP) as a computational model for investigating NVA. We model argumentation as constraint propagation in DCSP. This model enables us to study convergence properties of argumentation, and formulate and experimentally compare 16 different NVA strategies with different levels of agent cooperativeness towards others. One surprising result from our experiments is that maximizing cooperativeness is not necessarily the best strategy even in a completely cooperative environment. The paper illustrates the usefulness of these results in applying NVA to multi-agent systems, as well as to DCSP systems in general.
- 1.A. Armstrong and E. H. Durfee, Dynamic prioritization of complex agents in distributed constraint satisfaction problems, Proc. of IJCAI, 1997.Google Scholar
- 2.Mike Chia, Daniel Neiman, and Victor Lesser, Poaching and distraction in asynchronous agent activities, Proc. of the Intl. Conf. on Multi-Agent Systems, 1998. Google ScholarDigital Library
- 3.Daniel Frost and Rina Dechter, Look-ahead value ordering for constraint satisfaction problems, Proc. of IJCAI, 1995. Google ScholarDigital Library
- 4.B. Grosz, Collaborating systems, AI magazine, 17(2), 1996.Google Scholar
- 5.N. R. Jennings et al., On argumentation-based negotiation, Proc. of the Intl. Workshop on Multi-Agent Systems, 1998.Google Scholar
- 6.S. Kraus, K. Sycara, and A. Evenchik, A., Reaching agreements through argumentation: a logical model and implementation, Artificial Intelligence, 104:1-70, 1998. Google ScholarDigital Library
- 7.V. Kumar, Algorithms for constraint-satisfaction problems: A survey, AI Magazine, 12(1), Spring 1992. Google ScholarDigital Library
- 8.Jyi-Shane Liu and Katia P. Sycara, Multiagent coordination in tightly coupled task scheduling, Proc. of ICMAS, 1996.Google Scholar
- 9.N. Matos, C. Sierra, N. R. Jennings, Determining successful negotiation strategies: an evolutionary approach, Proc. of the Intl. Conf. on Multi-Agent Systems, 1998. Google ScholarDigital Library
- 10.S. Minton, M. D. Johnston, A. Philips, and P. Laird, Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method, Proc. of AAAI, 1990.Google Scholar
- 11.H. Sawamura, Y. Umeda, and R. K. Meyer, Computational dialectics for argument-based agent systems, Proc. of the Intl. Conf. on Multi-Agent Systems, 2000. Google ScholarDigital Library
- 12.M. Tambe, Towards flexible teamwork, Journal of Artificial Intelligence Research (JAIR), 7:83-124, 1997. Google ScholarDigital Library
- 13.M. Tambe and H. Jung, The benefits of arguing in a team, AI Magazine, 20(4), 1999.Google Scholar
- 14.M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Transactions on Knowledge and Data Engineering, 10(5):673-685, 1998. Google ScholarDigital Library
- 15.M. Yokoo and K. Hirayama, Distributed constraint satisfaction algorithm for complex local problems, Proc. of the Intl. Conf. on Multi-Agent Systems, 1998. Google ScholarDigital Library
Index Terms
- Argumentation as distributed constraint satisfaction: applications and results
Recommendations
Argumentation frameworks as constraint satisfaction problems
Argumentation is a promising approach for defeasible reasoning. It consists of justifying each plausible conclusion by arguments. Since the available information may be inconsistent, a conclusion and its negation may both be justified. The arguments are ...
Algorithms for Distributed Constraint Satisfaction: A Review
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem to find a consistent combination of actions that ...
Comments