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

DOI10.1145/1109557.1109642zbMath1192.05060OpenAlexW3138875242MaRDI QIDQ5901128

Lisa K. Fleischer, Don Coppersmith, Atri Rudra

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

Rank aggregation: new bounds for MCx, Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists, Feedback arc set problem in bipartite tournaments, Label ranking by learning pairwise preferences, A survey on the linear ordering problem for weighted or unweighted tournaments, Algorithm selection on a meta level, Fuzzy K-Minpen Clustering and K-nearest-minpen Classification Procedures Incorporating Generic Distance-Based Penalty Minimizers, Preference-based learning to rank, Kernels for feedback arc set in tournaments, Voting Procedures, Complexity of, Supervised clustering of label ranking data using label preference information, On the approximability of Dodgson and Young elections, Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order, An updated survey on the linear ordering problem for weighted or unweighted tournaments, A randomized approximation algorithm for computing bucket orders, Ranking tournaments with no errors. I: Structural description, Robust reductions from ranking to classification, An Algorithmic View of Voting, Socially desirable approximations for dodgson’s voting rule, On predictive accuracy and risk minimization in pairwise label ranking, On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments