Acyclic sets of linear orders

DOI10.1007/S003550050055MaRDI QIDQ2365087zbMATH OpenOpenAlexFDO

Authors Peter Fishburn

Publication date 4 February 1997

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003550050055

zbMATH Keywords

acyclic sets of linear ordersimproved lower and upper bounds

Mathematics Subject Classification ID

Individual preferences (91B08)

Recommendations

• Acyclic sets of linear orders: a progress report
• Acyclic sets in k-majority tournaments
• Acyclic sets of linear orders via the Bruhat orders
• Limits of acyclic voting
• How Large are Transitive Simple Majority Domains?

Cited in

(34)

• Ladders in ordered sets
• Finding sharper distinctions for conditions of transitivity of the majority method.
• The single-peaked domain revisited: a simple global characterization
• Decision theory and discrete mathematics
• Maximal Condorcet domains
• Cambrian acyclic domains: counting \(c\)-singletons
• Structured preferences: a literature survey
• Constructing large peak-pit Condorcet domains
• Random assignments on sequentially dichotomous domains
• Arrow on domain conditions: a fruitful road to travel
• 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
• Unifying voting theory from Nakamura's to Greenberg's theorems
• Acyclic sets of linear orders via the Bruhat orders
• Acyclic sets of linear orders: a progress report
• Linear Orders in the Pushdown Hierarchy
• Condorcet domains of tiling type
• Triple-consistent social choice and the majority rule
• A classification of peak-pit maximal Condorcet domains
• Symmetric maximal Condorcet domains
• Structure of single-peaked preferences
• Coding and counting arrangements of pseudolines
• The largest Condorcet domain on 8 alternatives
• Maximal Condorcet domains. A further progress report
• The mathematical psychology of Peter Fishburn
• A family of Condorcet domains that are single-peaked on a circle
• c-Birkhoff polytopes
• 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
• Condorcet domains on at most seven alternatives
• Subcyclic sets of linear orders

This page was built for publication: Acyclic sets of linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365087)