Comparing Partial Rankings

DOI10.1137/05063088XMaRDI QIDQ5757381zbMATH OpenOpenAlexFDO

Authors Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee

Publication date 6 September 2007

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/05063088x

zbMATH Keywords

bucket ordermetricpartial rankingpermutation

Mathematics Subject Classification ID

Partial orders, general (06A06) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Computing distances between partial rankings
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• Metric methods for analyzing partially ranked data
• Comparing and aggregating partial orders with Kendall tau distances

Cited in

(39)

• Metric methods for analyzing partially ranked data
• Right invariant metrics and measures of presortedness
• Beyond rankings: comparing directed acyclic graphs
• Comparing partial consistencies
• On the hardness of maximum rank aggregation problems
• New inconsistency indicators for incomplete pairwise comparisons matrices
• Order distances and split systems
• A linear ordering problem of sets
• Towards quantification of incompleteness in the pairwise comparisons methods
• Distance and consensus for preference relations corresponding to ordered partitions
• Antithetic and Monte Carlo kernel estimators for partial rankings
• Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• Approaching the rank aggregation problem by local search-based metaheuristics
• Comparing series of rankings with ties by using complex networks: an analysis of the Spanish stock market (IBEX-35 index)
• Aggregating preferences represented by conditional preference networks
• A new method for comparing rankings through complex networks: model and analysis of competitiveness of major European soccer leagues
• Comparing and aggregating partial orders with Kendall tau distances
• Ranking chain sum orders
• The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
• scientific article; zbMATH DE number 5968935 (Why is no real title available?)
• A Borda count for collective sentiment analysis
• RANK DIFFERENCES FOR OVERPARTITIONS
• Versatile string kernels
• Comparing Top k Lists
• scientific article; zbMATH DE number 2079318 (Why is no real title available?)
• A biplex approach to PageRank centrality: From classic to multiplex networks
• Weakened transitive rationality: invariance of numerical representations of preferences
• Vaquita: fast and accurate identification of structural variation using combined evidence
• An extended Mallows model for ranked data aggregation
• Comparing and Aggregating Partially Resolved Trees
• An ELECTRE III based consensus‐reaching process to improve a collective solution
• A new interpretation and derivation of the Swaps index
• A note on permutations and rank aggregation
• Comparing and aggregating partially resolved trees
• Creditworthiness of small and medium enterprises: a fuzzy decision-making approach
• Modelling and analysis of rank ordered data with ties via a generalized Plackett-Luce model
• An extension of May's theorem to three alternatives: axiomatizing Minimax voting
• Computing distances between partial rankings

This page was built for publication: Comparing Partial Rankings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757381)