Maximal Condorcet domains

DOI10.1007/s11083-011-9235-zzbMath1312.91047OpenAlexW2150052606MaRDI QIDQ1943690

Gleb A. Koshevoy, Vladimir I. Danilov

Publication date: 20 March 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-011-9235-z

zbMATH Keywords

distributive latticeweak Bruhat ordersimple majority rulebinary plane tree

Mathematics Subject Classification ID

Voting theory (91B12) Structure and representation theory of distributive lattices (06D05) Total orders (06A05)

Related Items (10)

Random assignments on sequentially dichotomous domains ⋮ Symmetric maximal Condorcet domains ⋮ Structure of single-peaked preferences ⋮ Majority rule on rhombus tilings and Condorcet super-domains ⋮ Towards a classification of maximal peak-pit Condorcet domains ⋮ The single-peaked domain revisited: a simple global characterization ⋮ Condorcet domains, median graphs and the single-crossing property ⋮ Condorcet domains satisfying Arrow's single-peakedness ⋮ Structured preferences: a literature survey ⋮ Constructing large peak-pit Condorcet domains

Cites Work

• Acyclic sets of linear orders
• Acyclic sets of linear orders via the Bruhat orders
• Partial orderings of permutations and monotonicity of a rank correlation statistic
• Combinatorics of Coxeter Groups
• An Axiomatic Theory of Tournament Aggregation
• The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximal Condorcet domains