Condorcet domains of tiling type
From MaRDI portal
Abstract: A Condorcet domain (CD) is a collection of linear orders on a set of candidates satisfying the following property: for any choice of preferences of voters from this collection, a simple majority rule does not yield cycles. We propose a method of constructing "large" CDs by use of rhombus tiling diagrams and explain that this method unifies several constructions of CDs known earlier. Finally, we show that three conjectures on the maximal sizes of those CDs are, in fact, equivalent and provide a counterexample to them.
Recommendations
- Majority rule on rhombus tilings and Condorcet super-domains
- Domino tilings on planar regions
- Condorcet domains: a geometric perspective
- Spaces of domino tilings
- Tiling Turán theorems
- Tilings in topological spaces
- Domino tilings and determinants
- Tiling by hyperbolic dominoes
- Families of non-tiling domains satisfying Pólya’s conjecture
Cites work
- Acyclic sets of linear orders
- Acyclic sets of linear orders via the Bruhat orders
- Axioms and hulls
- Higher Bruhat orders and cyclic hyperplane arrangements
- scientific article; zbMATH DE number 4147800 (Why is no real title available?)
- scientific article; zbMATH DE number 5556709 (Why is no real title available?)
- scientific article; zbMATH DE number 1126912 (Why is no real title available?)
- scientific article; zbMATH DE number 1182898 (Why is no real title available?)
- scientific article; zbMATH DE number 3895080 (Why is no real title available?)
- Parametrizations of canonical bases and totally positive matrices
- Plücker environments, wiring and tiling diagrams, and weakly separated set-systems
- Rhombic tilings of polygons and classes of reduced words in Coxeter groups
- The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
Cited in
(22)- The single-peaked domain revisited: a simple global characterization
- Maximal Condorcet domains
- Cambrian acyclic domains: counting \(c\)-singletons
- Structured preferences: a literature survey
- Constructing large peak-pit Condorcet domains
- Majority rule on rhombus tilings and Condorcet super-domains
- 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
- Condorcet domains: a geometric perspective
- The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders
- A classification of peak-pit maximal Condorcet domains
- Symmetric maximal Condorcet domains
- Structure of single-peaked preferences
- The largest Condorcet domain on 8 alternatives
- Maximal Condorcet domains. A further progress report
- A family of Condorcet domains that are single-peaked on a circle
- Revealed preference domains from random choice
- Equivalence of connected and peak-pit maximal Condorcet domains
- An efficient heuristic search algorithm for discovering large Condorcet domains
- Coherent domains and improved lower bounds for the maximum size of Condorcet domains
This page was built for publication: Condorcet domains of tiling type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423890)