Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
Improved lower bounds for the maximum size of Condorcet domains
Alexander Karpov, Klas Markstrom, Soren Riis +1
Condorcet domains are sets of linear orders with the property that, whenever voters' preferences are restricted to the domain, the pairwise majority relation (for an odd number of…
cs.DM2025
An orderly algorithm for generation of Condorcet Domains
Bei Zhou, Klas Markström
Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set,…
cs.DM2024
A heuristic search algorithm for discovering large Condorcet domains
Bei Zhou, Søren Riis
The study of large Condorcet domains (CD) has been a significant area of interest in voting theory. In this paper, our goal is to search for large CDs that are hitherto unknown. Wi…