How Large are Transitive Simple Majority Domains?
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Decision theory and discrete mathematics
- Maximal Condorcet domains
- A simple construction of complete single-peaked domains by recursive tiling
- Condorcet domains satisfying Arrow's single-peakedness
- Acyclic sets of linear orders
- Are there any nicely structured preference profiles nearby?
- scientific article; zbMATH DE number 989724 (Why is no real title available?)
- Intrinsic Limitations of the Majority Rule, an Algorithmic Approach
- scientific article; zbMATH DE number 4043899 (Why is no real title available?)
- The Weak Bruhat Order of $\text{S}_\Sigma $, Consistent Sets, and Catalan Numbers
- Maximal Condorcet domains. A further progress report
- An efficient heuristic search algorithm for discovering large Condorcet domains
- Coherent domains and improved lower bounds for the maximum size of Condorcet domains
- Condorcet domains on at most seven alternatives
- TP\(_2\) = Bruhat
This page was built for publication: How Large are Transitive Simple Majority Domains?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222214)