Synthetic description of a semiorder

DOI10.1016/0166-218X(91)90057-4zbMath0737.06005WikidataQ126781248 ScholiaQ126781248MaRDI QIDQ1175797

Marc Pirlot

Publication date: 25 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

semiorderpreference modellingnoseshollowsincidence step matrixsynthetic description

Mathematics Subject Classification ID

Group preferences (91B10) Ordered sets (06A99)

Related Items (14)

Any complete preference structure without circuit admits an interval representation ⋮ Well-graded families of relations ⋮ On properties of unit interval graphs with a perceptual motivation ⋮ Rectangles, Fringes, and Inverses ⋮ The representation polyhedron of a semiorder. ⋮ A Note on Candeal and Induráin’s Semiorder Separability Condition ⋮ Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory ⋮ Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms ⋮ Continuous representability of semiorders ⋮ Unit representation of semiorders. I: Countable sets ⋮ Unit representation of semiorders. II: The general case ⋮ Extending partial representations of proper and unit interval graphs ⋮ Scott-suppes representability of semiorders: Internal conditions ⋮ Numerical representability of semiorders

Cites Work

• Biorder families, valued relations, and preference modelling
• Minimal representation of a semiorder
• Betweenness, orders and interval graphs
• Threshold-Bounded Interval Orders and a Theory of Picycles
• Threshold Representations of Multiple Semiorders
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthetic description of a semiorder