A new approach for identifying the Kemeny median ranking
From MaRDI portal
Publication:2333014
Recommendations
- Experiments with Kemeny ranking: What works when?
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Partial kernelization for rank aggregation: theory and experiments
- The voting rules of Kondorse and Bord
Cites work
- scientific article; zbMATH DE number 3148878 (Why is no real title available?)
- scientific article; zbMATH DE number 3972536 (Why is no real title available?)
- scientific article; zbMATH DE number 44383 (Why is no real title available?)
- scientific article; zbMATH DE number 1288298 (Why is no real title available?)
- scientific article; zbMATH DE number 3400720 (Why is no real title available?)
- scientific article; zbMATH DE number 3405712 (Why is no real title available?)
- A Consistent Extension of Condorcet’s Election Principle
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- A new rank correlation coefficient with application to the consensus ranking problem
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Binary choice probabilities: on the varieties of stochastic transitivity
- Condorcet proportions and Kelly's conjectures
- Cyclic ordering is NP-complete
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Experiments with Kemeny ranking: What works when?
- Fixed-parameter algorithms for Kemeny rankings
- From social welfare ordering to acyclic aggregation of preferences
- How many voters are needed for paradoxes?
- Intensity of preference and related uncertainty in non-compensatory aggregation rules
- Majority cycles in a multi-dimensional setting
- Median linear orders: Heuristics and a branch and bound algorithm
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- New results on the computation of median orders
- Rank aggregation: together we're strong
- The linear ordering problem revisited
- Voting games and acyclic collective choice rules
- Voting schemes for which it can be difficult to tell who won the election
Cited in
(16)- Computing kemeny rankings from d-Euclidean preferences
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
- Heuristic methods of constructing the median in group choice
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- Improved Kemeny Median Indicator Ranks Accordance Method
- On the computation of median linear orders, of median complete preorders and of median weak orders
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Accurate algorithms for identifying the median ranking when dealing with weak and partial rankings under the Kemeny axiomatic approach
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Consensus formation from heterogeneous rankings based on minimum variance
- Experiments with Kemeny ranking: What works when?
- Median constrained bucket order rank aggregation
- Ranking median regression: learning to order through local consensus
- An algebraic framework for uniformly analyzing interval pairwise comparison matrices
- Decomposition procedures in problems of construction of strict resulting ranking of objects in the form of the Kemeny-Snell median
This page was built for publication: A new approach for identifying the Kemeny median ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333014)
