The rankability of weighted data from pairwise comparisons
From MaRDI portal
Publication:2069943
DOI10.3934/fods.2021002zbMath1478.62381OpenAlexW3123808560MaRDI QIDQ2069943
Paul E. Anderson, Timothy P. Chartier, Kathryn E. Pedings-Behling, Amy N. Langville
Publication date: 21 January 2022
Published in: Foundations of Data Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/fods.2021002
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Combinatorial optimization (90C27) Individual preferences (91B08) Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15) Statistical aspects of big data and data science (62R07)
Related Items
Fairness and the set of optimal rankings for the linear ordering problem, Rankability and linear ordering problem: probabilistic insight and algorithms, Weight set decomposition for weighted rank and rating aggregation: an interpretable and visual decision support tool, On the linear ordering problem and the rankability of data
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum violations ranking method
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Statistical ranking and combinatorial Hodge theory
- SCIP: solving constraint integer programs
- Finding an interior point in the optimal face of linear programs
- On the graph Laplacian and the rankability of data
- Sensitivity and Stability of Ranking Vectors
- On the Minimum Violations Ranking of a Tournament
- Priority Ranking and Consensus Formation: The Case of Ties
- Priority Ranking and Consensus Formation
- The Rankability of Data
- Aggregating inconsistent information