Showing 2026Show all
2 papers · 1 filter
cs.DM2026
Tournaments not inducible by five voters
Leonid Chindelevitch, Ararat Harutyunyan
A tournament T is k-inducible if there are k linear orders on its vertex set such that, for every arc of T, a majority of the orders rank i above j. For odd k, let N(k) b…
cs.DM2026
Tournaments determined by three and five voters
Leonid Chindelevitch, Ararat Harutyunyan
The Kemeny median problem asks for a linear order minimizing the total pairwise disagreement with given rankings of options; it is NP-hard for every even and ever…