A new approach for identifying the Kemeny median ranking
From MaRDI portal
Publication:2333014
DOI10.1016/j.ejor.2019.08.033zbMath1431.91131OpenAlexW2970583499WikidataQ127331818 ScholiaQ127331818MaRDI QIDQ2333014
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
artificial intelligencesocial choicemultiple criteriadecision analysisbig datacombinatorial optimisationdefence and security
Combinatorial optimization (90C27) Pattern recognition, speech recognition (68T10) Individual preferences (91B08)
Related Items (5)
A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Solving the Kemeny ranking aggregation problem with quantum optimization algorithms ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Experiments with Kemeny ranking: What works when?
- Median linear orders: Heuristics and a branch and bound algorithm
- Fixed-parameter algorithms for Kemeny rankings
- From social welfare ordering to acyclic aggregation of preferences
- Voting schemes for which it can be difficult to tell who won the election
- Condorcet proportions and Kelly's conjectures
- Cyclic ordering is NP-complete
- New results on the computation of median orders
- Voting games and acyclic collective choice rules
- Binary choice probabilities: on the varieties of stochastic transitivity
- How many voters are needed for paradoxes?
- Majority cycles in a multi-dimensional setting
- Intensity of preference and related uncertainty in non-compensatory aggregation rules
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Multicriteria methodology for decision aiding. Transl. from the French by Mark R. McCord
- The linear ordering problem revisited
- A Consistent Extension of Condorcet’s Election Principle
- A new rank correlation coefficient with application to the consensus ranking problem
- Rank Aggregation: Together We're Strong
This page was built for publication: A new approach for identifying the Kemeny median ranking
