Fusion of multiagent preference orderings with information on agent's importance being incomplete certain

The problem of fusing multiagent preference orderings, with information on agent's importance being incomplete certain with respect to a set of possible courses of action, is described. The approach is developed for dealing with the fusion problem described in the following sections and requires that each agent provides a preference ordering over the different alternatives completely independent of the other agents, and the information on agent's importance is incomplete certain. In this approach, the ternary comparison matrix of the alternatives is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained so as to normalize priority vector of the alternatives. The interval number of the alternatives is then obtained by solving two sorts of linear programming problems. By comparing the interval numbers of the alternatives, the ranking of alternatives can be generated. Finally, some examples are given to show the feasibility and effectiveness of the method.