arXiv (All)
open access
Condorcet-type properties of the linear ordering problem with ties
The Kemeny rule aggregates multiple strict rankings into a single strict ranking that minimizes the sum of its distances from the input rankings. The resulting optimization problem, called the Kemeny problem (\texttt{KP}), is a special case of the linear ordering problem (\texttt{LOP}). The Kemeny r
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An optimal constant for vector balancing with permutations#1157475
- Borda Aggregation Dynamics of Preference Orderings on Networks#974375
- The interval posets of permutations seen from the decomposition tree perspective#156434
- Conjugating full cycles by adjacent transpositions: diameter and sorting time#925898
- Multimmit: Extending Blocks for Faster Finality#785199
Record · ID 1014183
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive