A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
From MaRDI portal
Publication:5868914
DOI10.1287/deca.2021.0433OpenAlexW3201446391MaRDI QIDQ5868914
Yeawon Yoo, Adolfo R. Escobedo
Publication date: 26 September 2022
Published in: Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/deca.2021.0433
Related Items (4)
Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons ⋮ An axiomatic distance methodology for aggregating multimodal evaluations
Uses Software
Cites Work
- Unnamed Item
- 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
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- Creating a consensus ranking of proposals from reviewers' partial ordinal rankings
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms
- Voting schemes for which it can be difficult to tell who won the election
- Weak order polytopes.
- Exploring the median of permutations problem
- Borda rule, Copeland method and strategic manipulation.
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings
- Space oriented rank-based data integration
- The repeated insertion model for rankings: missing link between two subset choice models
- Geometric representation of association between categories
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- The Borda count and agenda manipulation
- A Bayesian Mallows approach to nontransitive pair comparison data: how human are sounds?
- Distance-based and ad hoc consensus models in ordinal preference ranking
- Facets of the Weak Order Polytope Derived from the Induced Partition Projection
- Improving Discrete Model Representations via Symmetry Considerations
- Tournaments, transitivity and pairwise comparison matrices
- NON-NULL RANKING MODELS. I
- Symmetry Definitions for Constraint Satisfaction Problems
- Ordinal Ranking with Intensity of Preference
- Priority Ranking and Consensus Formation
- A Consistent Extension of Condorcet’s Election Principle
- Aggregation of Preferences with Variable Electorate
- A new rank correlation coefficient with application to the consensus ranking problem
- Handbook of Computational Social Choice
- Automatic Generation of Symmetry-Breaking Constraints
- A NEW MEASURE OF RANK CORRELATION
- THE TREATMENT OF TIES IN RANKING PROBLEMS
- Aggregating inconsistent information
This page was built for publication: A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation
