Pages that link to "Item:Q2333014"
From MaRDI portal
The following pages link to A new approach for identifying the Kemeny median ranking (Q2333014):
Displaying 11 items.
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach (Q62323) (← links)
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Experiments with Kemeny ranking: What works when? (Q449040) (← links)
- Heuristic methods of constructing the median in group choice (Q1114568) (← links)
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- Median constrained bucket order rank aggregation (Q2418073) (← links)
- Computing kemeny rankings from \(d\)-Euclidean preferences (Q2695434) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms (Q6139170) (← links)
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems (Q6164371) (← links)
