Threshold aggregation of multi-graded rankings
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 58 (2009)
Issue (Month): 1 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Aggregation Ranking Pareto;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Aleskerov, Fuad & Yakuba, Vyacheslav & Yuzbashev, Dmitriy, 2007. "A `threshold aggregation' of three-graded rankings," Mathematical Social Sciences, Elsevier, vol. 53(1), pages 106-110, January.
- Hillinger, Claude, 2004. "Voting and the Cardinal Aggregation of Judgments," Discussion Papers in Economics 353, University of Munich, Department of Economics.
- Biung-Ghi Ju, 2005. "An efficiency characterization of plurality social choice on simple preference domains," Economic Theory, Springer, vol. 26(1), pages 115-128, 07.
If references are entirely missing, you can add them using this form.