Recursive inversion models for permutations

DOI10.1007/s11222-022-10111-4zbMath1490.62020OpenAlexW2171935568MaRDI QIDQ2152564

Annelise Wagner, Marina Meilă, Christopher Meek

Publication date: 8 July 2022

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11222-022-10111-4

zbMATH Keywords

permutationsmaximum likelihoodpreferencespartial rankingsranked datageneralized Mallows modelrecursive inversion models

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Statistical ranking and selection procedures (62F07)

Cites Work

• Optimization by Simulated Annealing
• Experiments with Kemeny ranking: What works when?
• Voting schemes for which it can be difficult to tell who won the election
• Uncovering the riffled independence structure of ranked data
• Riffled Independence for Efficient Inference with Partial Rankings
• NON-NULL RANKING MODELS. I
• Rank Aggregation: Together We're Strong
• An efficient context-free parsing algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursive inversion models for permutations