Distributed quiescence detection in multiagent negotiation

In a distributed multiagent negotiation involving multiple issues, it is often desirable to finalize deals only when all related issues are resolved. However, detecting that a multiagent negotiation has reached a globally quiescent state can be a nontrivial task in a distributed, asynchronous system. We present a quiescence detection protocol based on the Dijkstra-Scholten algorithm for distributed termination detection (D.W. Dijkstra and C.S. Scholten, 1980). The protocol operates as a layer on top of an underlying mediated negotiation protocol. If agents conform to the detection protocol, the detection process terminates iff the negotiation is quiescent. We discuss agent incentives to deviate from the protocol, and describe extensions that enforce adherence with respect to the most significant potential deviations.

[1]  Jeffrey S. Rosenschein,et al.  Rules of Encounter - Designing Conventions for Automated Negotiation among Computers , 1994 .

[2]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

[3]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[4]  Gil Tidhar,et al.  A Contract Net with Consultants: An Alternative Architecture and Experimental Results , 1992, ECAI.

[5]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[6]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[7]  Michael P. Wellman,et al.  Efficiency and Equilibrium in Task Allocation Economies with Hierarchical Dependencies , 1999, IJCAI.

[8]  Martin Andersson,et al.  Leveled commitment contracting among myopic individually rational agents , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[9]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[10]  R. McAfee,et al.  Analyzing the Airwaves Auction , 1996 .

[11]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[12]  Michael P. Wellman.  A Market-Oriented Programming Environment and its Application to Distributed Multicommodity Flow Problems , 1993, J. Artif. Intell. Res..

[13]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[14]  Victor Lesser,et al.  Negotiation among self-interested computationally limited agents , 1996 .

[15]  Michael P. Wellman,et al.  A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[16]  Arne Andersson,et al.  Managing large scale computational markets , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[17]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[18]  Yoav Shoham,et al.  Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.