Threshold aggregation of multi-graded rankings
A recent paper by Aleskerov et al. [Aleskerov, F., Yakuba, V., Yuzbashev, D., 2007. A 'threshold aggregation' of three-graded rankings. Mathematical Social Sciences 53, 106-110] characterizes so-called threshold aggregation rules of three-graded rankings in terms of four axioms Anonymity, Cancelation, Pareto, and Non-compensatory Threshold. In this paper we extend this result to the case of multi-graded rankings, and we provide an alternative characterization in terms of slightly weaker axioms.
Year of publication: |
2009
|
---|---|
Authors: | Woeginger, Gerhard J. |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 58.2009, 1, p. 58-63
|
Publisher: |
Elsevier |
Subject: | Aggregation Ranking Pareto |
Saved in:
Saved in favorites
Similar items by person
-
The trouble with the second quantifier
Woeginger, Gerhard J., (2021)
-
An axiomatic characterization of the Hirsch-index
Woeginger, Gerhard J., (2008)
-
Threshold aggregation of multi-graded rankings
Woeginger, Gerhard J., (2009)
- More ...