Symmetric maximal Condorcet domains
From MaRDI portal
Publication:6171422
DOI10.1007/s11083-022-09612-8OpenAlexW4297908261MaRDI QIDQ6171422
Arkadii M. Slinko, Alexander Karpov
Publication date: 18 July 2023
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-022-09612-8
majority votingCondorcet paradoxsimple permutationsmedian graphCondorcet domainscomposition of domains
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Condorcet domains of tiling type
- A survey of the algorithmic aspects of modular decomposition
- Independence of clones as a criterion for voting rules
- Partitive hypergraphs
- The structure of median graphs
- The single-peaked domain revisited: a simple global characterization
- Restricted permutations and the wreath product
- Composition-consistent tournament solutions and social choice functions
- Maximal Condorcet domains
- Cambrian acyclic domains: counting \(c\)-singletons
- Interval posets of permutations
- The clone relation of a binary relation
- Condorcet domains, median graphs and the single-crossing property
- Condorcet domains satisfying Arrow's single-peakedness
- A simple proof of a theorem of Schmerl and Trotter for permutations
- Acyclic sets of linear orders
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Acyclic sets of linear orders via the Bruhat orders
- Simple permutations and pattern restricted permutations
- A Survey of Simple Permutations
- Intermediate Preferences and the Majority Rule
- An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
- Overview of Mathematical Social Sciences
- A Possibility Theorem on Majority Decisions
- The Simple Majority Decision Rule
This page was built for publication: Symmetric maximal Condorcet domains
