Constructing large peak-pit Condorcet domains
From MaRDI portal
Publication:2112304
DOI10.1007/s11238-022-09878-9zbMath1505.91164OpenAlexW4213420039MaRDI QIDQ2112304
Alexander Karpov, Arkadii M. Slinko
Publication date: 10 January 2023
Published in: Theory and Decision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11238-022-09878-9
Condorcet domainArrow's single-peaked domainDanilov-Karzanov-Koshevoy constructionnever conditionspeak-pit domain
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Condorcet domains of tiling type
- Coding and counting arrangements of pseudolines
- The structure of median graphs
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- Restricted preference domains in social choice: two perspectives
- The single-peaked domain revisited: a simple global characterization
- Decision theory and discrete mathematics
- Maximal Condorcet domains
- Cambrian acyclic domains: counting \(c\)-singletons
- Towards a classification of maximal peak-pit Condorcet domains
- A simple construction of complete single-peaked domains by recursive tiling
- Condorcet domains, median graphs and the single-crossing property
- Condorcet domains satisfying Arrow's single-peakedness
- Acyclic sets of linear orders
- Acyclic sets of linear orders via the Bruhat orders
- Acyclic sets of linear orders: a progress report
- The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
- Overview of Mathematical Social Sciences
- VC-dimension of sets of permutations