In the domain of distributed AI (DAI), two negotiation mechanisms (one strict and one tolerant), and a negotiation strategy, for the situation where agents' goals are common knowledge, but the worths they attach to those goals are private are presented. All possible prototypical classes of (non-conflict) encounters are analyzed, and it is shown where the strategy and mechanisms result in stable and/or efficient solutions. In most cases, the negotiation strategy is both stable and efficient. These are two situations in which the strategy, in combination with both mechanisms, results in a conflict (a non-efficient result). The reason for this inefficiency may be the failure to include conflict-resolution techniques. It is conjectured that enhancing the mechanisms with such techniques would result in a stable and efficient outcome in those two situations as well.<<ETX>>
[1]
Katia P. Sycara,et al.
Argumentation: Planning Other Agents' Plans
,
1989,
IJCAI.
[2]
Jeffrey S. Rosenschein,et al.
A Domain Theory for Task Oriented Negotiation
,
1993,
IJCAI.
[3]
Edmund H. Durfee,et al.
Coordination of distributed problem solvers
,
1988
.
[4]
G. Zlotkin,et al.
Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains
,
1991,
IEEE Trans. Syst. Man Cybern..
[5]
Reid G. Smith,et al.
A framework for problem solving in a distributed processing environment
,
1978
.