The following pages link to Acyclic sets of linear orders (Q2365087):
Displayed 21 items.
- Condorcet domains of tiling type (Q423890) (← links)
- Triple-consistent social choice and the majority rule (Q456955) (← links)
- Coding and counting arrangements of pseudolines (Q644821) (← links)
- Finding sharper distinctions for conditions of transitivity of the majority method. (Q1414238) (← links)
- The single-peaked domain revisited: a simple global characterization (Q1757559) (← links)
- Decision theory and discrete mathematics (Q1923611) (← links)
- Maximal Condorcet domains (Q1943690) (← links)
- Cambrian acyclic domains: counting \(c\)-singletons (Q2006983) (← links)
- Structured preferences: a literature survey (Q2096158) (← links)
- Constructing large peak-pit Condorcet domains (Q2112304) (← links)
- Random assignments on sequentially dichotomous domains (Q2173423) (← links)
- Arrow on domain conditions: a fruitful road to travel (Q2179463) (← links)
- Towards a classification of maximal peak-pit Condorcet domains (Q2243532) (← links)
- A simple construction of complete single-peaked domains by recursive tiling (Q2283307) (← links)
- Condorcet domains, median graphs and the single-crossing property (Q2323590) (← links)
- Condorcet domains satisfying Arrow's single-peakedness (Q2338669) (← links)
- Unifying voting theory from Nakamura's to Greenberg's theorems (Q2453823) (← links)
- Acyclic sets of linear orders via the Bruhat orders (Q2475989) (← links)
- A classification of peak-pit maximal Condorcet domains (Q6080658) (← links)
- Symmetric maximal Condorcet domains (Q6171422) (← links)
- Structure of single-peaked preferences (Q6195534) (← links)