Simple, Robust and Optimal Ranking from Pairwise Comparisons
Research article (Journal of Machine Learning Research, 2015) · cited 60× · AI/ML
Press Enter · cited answer in seconds
.xyz
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
4ort.xyz Knowledge Graph. (2026). Simple, Robust and Optimal Ranking from Pairwise Comparisons. Retrieved May 24, 2026, from https://4ort.xyz/entity/simple-robust-and-optimal-ranking-from-pairwise-comparisons
“Simple, Robust and Optimal Ranking from Pairwise Comparisons.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/simple-robust-and-optimal-ranking-from-pairwise-comparisons.
@misc{4ortxyz_simple-robust-and-optimal-ranking-from-pairwise-comparisons_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Simple, Robust and Optimal Ranking from Pairwise Comparisons}}, year = {2026}, url = {https://4ort.xyz/entity/simple-robust-and-optimal-ranking-from-pairwise-comparisons}, note = {Accessed: 2026-05-24}}
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Simple, Robust and Optimal Ranking from Pairwise Comparisons — https://4ort.xyz/entity/simple-robust-and-optimal-ranking-from-pairwise-comparisons (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/simple-robust-and-optimal-ranking-from-pairwise-comparisons · Last refreshed: