Threshold aggregation of multi-graded rankings

G.J. Woeginger

doi:10.1016/j.mathsocsci.2009.02.001

Threshold aggregation of multi-graded rankings

G.J. Woeginger

Combinatorial Optimization

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Scopus)

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.

Original language	English
Pages (from-to)	58-63
Journal	Mathematical Social Sciences
Volume	58
Issue number	1
DOIs	https://doi.org/10.1016/j.mathsocsci.2009.02.001
Publication status	Published - 2009

Access to Document

10.1016/j.mathsocsci.2009.02.001

Cite this

@article{dc0601c4877049b9abfea702ab8fa56a,

title = "Threshold aggregation of multi-graded rankings",

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.",

author = "G.J. Woeginger",

year = "2009",

doi = "10.1016/j.mathsocsci.2009.02.001",

language = "English",

volume = "58",

pages = "58--63",

journal = "Mathematical Social Sciences",

issn = "0165-4896",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Threshold aggregation of multi-graded rankings

AU - Woeginger, G.J.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

U2 - 10.1016/j.mathsocsci.2009.02.001

DO - 10.1016/j.mathsocsci.2009.02.001

M3 - Article

SN - 0165-4896

VL - 58

SP - 58

EP - 63

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

IS - 1

ER -

Threshold aggregation of multi-graded rankings

Abstract

Access to Document

Fingerprint

Cite this