A new binary programming formulation and social choice property for Kemeny rank aggregation
Year of publication: |
2021
|
---|---|
Authors: | Yoo, Yaewon ; Escobedo, Adolfo R. |
Published in: |
Decision analysis : a journal of the Institute for Operations Research and the Management Sciences, INFORMS. - Catonsville, MD : Institute for Operations Research and the Management Sciences, ISSN 1545-8490, ZDB-ID 2141455-5. - Vol. 18.2021, 4, p. 296-320
|
Subject: | group decision making | rank aggregation | computational social choice | combinatorial optimization | Theorie | Theory | Neue politische Ökonomie | Public choice | Gruppenentscheidung | Group decision-making | Ranking-Verfahren | Ranking method | Aggregation | Soziale Wohlfahrtsfunktion | Social welfare function | Mathematische Optimierung | Mathematical programming |
-
Approximate condorcet partitioning : solving large-scale rank aggregation problems
Akbari, Sina, (2023)
-
Rico, Noelia, (2023)
-
Akbari, Sina, (2023)
- More ...
-
Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
Escobedo, Adolfo R., (2015)
-
Skolfield, J. Kyle, (2022)
-
A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
Yoo, Yeawon, (2020)
- More ...