Rank aggregation
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
Rank aggregation is a fundamental task in social choice theory. Given a collection of different rankings (total orders) over the same set of objects, the goal is to produce a single ranking of those objects that, in some way, aggregates the different opinions expressed by the input rankings. Rank aggregation has applications in many fields. For example, in biological research, several research methods may produce different rankings of objects (e.g., genes), and it is desirable to combine these into a single ranking. Shili Lin provides a survey of rank aggregation methods in biological contexts.
Rank aggregation is a fundamental task in social choice theory. Given a collection of different rankings (total orders) over the same set of objects, the goal is to produce a single ranking of those objects that, in some way, aggregates the different opinions expressed by the input rankings. Rank aggregation has applications in many fields. For example, in biological research, several research methods may produce different rankings of objects (e.g., genes), and it is desirable to combine these into a single ranking.
Shili Lin provides a survey of rank aggregation methods in biological contexts. 2. Aziz, Lederer, Peters, Peters and Ritossa present the Solid Coalition Refinement rule. It is a multiwinner voting rule that satisfies committee monotonicity. Hence, it can be used as a rank aggregation rule: the outcome for k=1 is the first in the ranking; the outcome for k=2 is the second in the ranking; and so on. For every k, the top k candidates in the resulting ranking satisfy a fairness property called Proportionality for Solid Coalitions.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1361951576 under CC BY-SA 4.0; modifications have been made.