An efficient heuristic search algorithm for discovering large Condorcet domains

Bei Zhou () and Søren Riis ()
Additional contact information
Bei Zhou: Imperial College London
Søren Riis: Queen Mary University of London

4OR, 2025, vol. 23, issue 2, No 3, 193-216

Abstract: Abstract We explore large peak-pit Condorcet domains (CD), an active research area in voting theory. The search for large CDs, defined combinatorially, serves as a benchmark for heuristic-based optimisation algorithms. Since 1996, Fishburn’s alternating scheme produced the largest known CDs for $$n \le 15$$ n ≤ 15 alternatives until recent discoveries surpassed it for $$n = 8$$ n = 8 and $$n \ge 13$$ n ≥ 13 . For $$8

Keywords: Condorcet domain; Combinatorial optimisation; Machine learning; Heuristic algorithms; 03; 68 (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-025-00583-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:23:y:2025:i:2:d:10.1007_s10288-025-00583-1

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-025-00583-1

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().