Abstract
In this paper, we classify all maximal peak-pit Condorcet domains of maximal width for n≤5 alternatives. To achieve this, we bring together ideas from several branches of combinatorics. The main tool used in the classification is the ideal of a domain. In contrast to the size of maximal peak-pit Condorcet domains of maximal width themselves, the size of their associated ideal is constant.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
