The threshold decision making

摘要

The problem of axiomatic and algorithmic constructions of the threshold decision making is studied in the case when individual opinions are given as m-graded strict preferences (with m > 3). It is shown that the only rule satisfying the introduced axioms is the threshold rule. Two explicit algorithms are presented: the ordering algorithm, under which the vector-grades of alternatives are successively written out, and an enumerating social decision function corresponding to the natural order of the weak order equivalence classes.