Threshold aggregation of multi-graded rankings

Gerhard J. Woeginger

Mathematical Social Sciences, 2009, vol. 58, issue 1, 58-63

Abstract: 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.

Keywords: Aggregation; Ranking; Pareto (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165-4896(09)00019-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:58:y:2009:i:1:p:58-63

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().