A new approach for identifying the Kemeny median ranking
DOI10.1016/J.EJOR.2019.08.033zbMATH Open1431.91131OpenAlexW2970583499WikidataQ127331818 ScholiaQ127331818MaRDI QIDQ2333014FDOQ2333014
Authors: Ivano Azzini, G. Munda 
Publication date: 6 November 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.08.033
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
big datadecision analysisartificial intelligencecombinatorial optimisationsocial choicemultiple criteriadefence and security
Pattern recognition, speech recognition (68T10) Individual preferences (91B08) Combinatorial optimization (90C27)
Cites Work
- 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
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Title not available (Why is that?)
- Experiments with Kemeny ranking: What works when?
- A new rank correlation coefficient with application to the consensus ranking problem
- Title not available (Why is that?)
- Voting schemes for which it can be difficult to tell who won the election
- Binary choice probabilities: on the varieties of stochastic transitivity
- Title not available (Why is that?)
- Intensity of preference and related uncertainty in non-compensatory aggregation rules
- A Consistent Extension of Condorcet’s Election Principle
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter algorithms for Kemeny rankings
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- Median linear orders: Heuristics and a branch and bound algorithm
- Cyclic ordering is NP-complete
- Rank Aggregation: Together We're Strong
- Voting games and acyclic collective choice rules
- Majority cycles in a multi-dimensional setting
- From social welfare ordering to acyclic aggregation of preferences
- New results on the computation of median orders
- How many voters are needed for paradoxes?
- The linear ordering problem revisited
- Condorcet proportions and Kelly's conjectures
Cited In (8)
- Solving the Kemeny ranking aggregation problem with quantum optimization algorithms
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner
- Heuristic methods of constructing the median in group choice
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings
- A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- Decomposition procedures in problems of construction of strict resulting ranking of objects in the form of the Kemeny-Snell median
- Computing kemeny rankings from \(d\)-Euclidean preferences
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)
