Efficient Deal Identification by Constraint Relaxation for Collaborative Decision Making Using Negotiation

抄録

Negotiation is one means for making decision collaboratively. We propose efficient protocols for identifying deals in such negotiations. Specifically we focus on situations in which the negotiators must agree upon one option from among many. This work proposes solutions to problems faced when automating negotiations over multiple and interdependent issues. When negotiations are over issues that are interdependent, previous and future decisions concerning other issues affect how one decides the current issue. Therefore generally we must deal with all of the issues at the same time. To identify deals for negotiations over multiple and interdependent issues previous work has proposed a bidding based protocol that works well only when there is a high probability that agents in the negotiation have local maxima at similar positions in the contract space. This happens only when the contract space is small and the number of agents in the negotiation is low. Otherwise the protocol fails to identify deals. We propose a multi round bidding approach in which agents submit supersets of their bids from earlier rounds. A superset of a bid is created by relaxing the constraints that it satisfies. We will use the same concept of negotiation using relaxed constraints to extend a Hill Climbing (HC) protocol. HC has a linear execution time cost. Ordinarily it can not be used for complex negotiations. But we modify it so that it is used optimally and efficiently for such negotiations.