Pages that link to "Item:Q2379921"
From MaRDI portal
The following pages link to Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists (Q2379921):
Displayed 23 items.
- Ranking chain sum orders (Q290525) (← links)
- Versatile string kernels (Q391141) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Average parameterization and partial kernelization for computing medians (Q716309) (← links)
- On the safety of Gomory cut generators (Q744203) (← links)
- Partial evaluation in rank aggregation problems (Q1652087) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Using extension sets to aggregate partial rankings in a flexible setting (Q1733690) (← links)
- On random social choice functions with the tops-only property (Q1753301) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- Bayesian analysis of rank data with covariates and heterogeneous rankers (Q2075787) (← links)
- Space reduction constraints for the median of permutations problem (Q2181257) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- Approaching the rank aggregation problem by local search-based metaheuristics (Q2423564) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)
- A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation (Q5868914) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization (Q6164344) (← links)
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems (Q6164371) (← links)
- Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons (Q6166889) (← links)