scientific article; zbMATH DE number 6982319

zbMath1445.62332MaRDI QIDQ4558170

Ashish Khetan, Sewoong Oh

Publication date: 21 November 2018

Full work available at URL: http://jmlr.csail.mit.edu/papers/v19/16-412.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Plackett-Luce modelrank aggregationsample and computational tradeoff

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Statistical ranking and selection procedures (62F07) Paired and multiple comparisons; multiple testing (62J15) Statistical aspects of big data and data science (62R07)

Related Items (1)

Discussion of the paper ‘A review of distributed statistical inference’

Uses Software

• Eigentaste

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Experiments with Kemeny ranking: What works when?
• Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
• MM algorithms for generalized Bradley-Terry models.
• Faster algorithms for finding lowest common ancestors in directed acyclic graphs
• Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
• Sum-of-squares Lower Bounds for Planted Clique
• Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
• Solution of a Ranking Problem from Binary Comparisons
• Computational and statistical tradeoffs via convex relaxation
• Lowest common ancestors in trees and directed acyclic graphs
• Rank Centrality: Ranking from Pairwise Comparisons

This page was built for publication: