Abstract:
A metric approach is applied to a class of group selection problems in which individual preferences are representable as linear series over a set of comparable alternatives, while group opinion is represented by relations such as dichotomic ranging, corresponding to the selection of a group of attractive alternatives from among all alternatives. Optimum algorithms for finding the set of attractive alternatives without resorting to search are obtained.