@conference {1510355,
	title = {Argumentation as Distributed Constraint Satisfaction: Applications and Results },
	booktitle = {International Conference on Autonomous Agents (Agents{\textquoteright}01)},
	year = {2001},
	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 realworld 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.},
	author = {H. Jung and Tambe, Milind}
}
