Ordering by weighted number of wins gives a good ranking for weighted tournaments

DOI10.1145/1798596.1798608zbMath1300.05297OpenAlexW2621110502MaRDI QIDQ5891893

Atri Rurda, Don Coppersmith, Lisa K. Fleischer

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1798596.1798608

zbMATH Keywords

tournamentsapproximation algorithmsrank aggregationfeedback arc set problemBorda's method

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items

Optimal Dislocation with Persistent Errors in Subquadratic Time, A data-driven matching algorithm for ride pooling problem, Using extension sets to aggregate partial rankings in a flexible setting, Proportional Approval Voting, Harmonic k-median, and Negative Association, Mallows and generalized Mallows model for matchings, Optimal dislocation with persistent errors in subquadratic time, Sorting with Recurrent Comparison Errors