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

The constraint proposal method for computing Pareto-optimal solutions is extended to multi-party negotiations. In the 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.