Abstract
A delegation process is proposed for setting the weights when a weighted sum of individual utility functions is used to make group decisions. Conditions under which a unique set of weights exist and methods for calculating these weights are obtained using the theory of Markov chains. It is shown that the Pareto optimal set at each step of delegation is a subset of the Pareto optimal set at the previous step.games/group decisions: teams, games/group decisions: voting/committees

This publication has 0 references indexed in Scilit: