Constraint-Directed Negotiation of Resource Reallocations

The resource reallocation problem requires multiagent choices under multiple-criteria, most of which are based on qualitative attributes. The conditional specification of a reallocation request (e.g., requiring a swap for one workstation with another) results in chains of reallocation transactions, which increase in complexity with the number of resources and agents. Also, the initial intentions for transactions may differ from the final transaction due to give-or-take on resource components. This work is motivated by human negotiation procedures, such as logrolling, bridging, and unlinking. We view the process of reallocation negotiations as being constraint based. Constraints can be used both for evaluation of existing alternatives as well as for creating new ones. We define a set of qualitative evaluation and relaxation (alternative generation) techniques based on human negotiation problem solving. The search uses several aspects of constraints, such as constraint importance, looseness, utility, and threshold levels. We evolve a mixed problem solving approach in which agents search individually in earlier stages and as a group in later stages. The constraint-directed negotiation approach is validated for the quality of solution in comparison to expert human negotiators on a variety of negotiation problems using a partial factorial design. The final version of the problem solver performs marginally better than the expert on experimental problems.

[1]  Stanley Baiman.  Agency research in managerial accounting: a survey , 1982 .

[2]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .

[3]  John W. Payne,et al.  Effort and Accuracy in Choice , 1985 .

[4]  Michael Jeng-Ping Shaw.  Distributed Planning In Cellular Flexible Manufacturing Systems , 1987 .

[5]  K. Arrow.  Social Choice and Individual Values , 1951 .

[6]  Jeffrey S. Rosenschein,et al.  Cooperation without Communication , 1986, AAAI.

[7]  O. Svenson.  Process descriptions of decision making. , 1979 .

[8]  John W. Payne,et al.  Task complexity and contingent processing in decision making: An information search and protocol analysis☆ , 1976 .

[9]  Ekaterini P. Sycara.  Resolving adversarial conflicts: an approach integration case-based and analytic methods , 1987 .

[10]  Steven F. Roth,et al.  Callisto: An Intelligent Project Management System , 1986, AI Mag..

[11]  Frederick Hayes-Roth,et al.  Distributed Intelligence for Air Fleet Control , 1981 .

[12]  Edmund H. Durfee,et al.  Coherent Cooperation Among Communicating Problem Solvers , 1987, IEEE Transactions on Computers.

[13]  A. Tversky.  Intransitivity of preferences. , 1969 .

[14]  Bruce G. Buchanan,et al.  Heuristic Programming Project , 1986 .

[15]  Victor R. Lesser,et al.  The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks , 1983, AI Mag..

[16]  H. V. Parunak.  Chapter 10 – Manufacturing Experience with the Contract Net , 1987 .

[17]  Stephen F. Smith.  Exploiting Temporal Knowledge to Organize Constraints , 1983 .

[18]  Mark S. Fox,et al.  An Investigation of Opportunistic Constraint Satisfaction in Space Planning , 1987, IJCAI.

[19]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[20]  Randall Steeb,et al.  Strategies of Cooperation in Distributed Problem Solving , 1983, IJCAI.

[21]  Jeffrey S. Rosenschein,et al.  Deals Among Rational Agents , 1985, IJCAI.