Constraint proposed method for computing Pareto solutions in multi-party negotiations

Constraint proposed method for computing Pareto solutions in multi-party negotiations

0.00 Avg rating0 Votes
Article ID: iaor20021907
Country: Netherlands
Volume: 133
Issue: 1
Start Page Number: 44
End Page Number: 61
Publication Date: Aug 2001
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: mathematical
Abstract:

The constraint proposal method for computing Pareto-optimal solutions is extended to multi-party negotiations. In this method a neutral coordinator assists decision makers in finding Pareto-optimal solutions so that the elicitation of the decision makers' value functions is not required. During the procedure the decision makers have to indicate their most preferred points on different sets of linear constraints. The method can be used to generate either one Pareto-optimal solution dominating the status quo solution of the negotiation or an approximation to the Pareto frontier. In the latter case a distributive negotiation among the efficient agreements can be carried out afterwards.

Reviews

Required fields are marked *. Your email address will not be published.