Minimal representation of a semiorder

DOI10.1007/BF00160932MaRDI QIDQ1262181zbMATH OpenFDO

Authors Marc Pirlot

Publication date 1990

Published in Theory and Decision (Search for Journal in Brave)

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

zbMATH Keywords

semiorderminimal representationvalued graphrank functionnumerical representationmulticriteria decision problem

Mathematics Subject Classification ID

Linear programming (90C05) Decision theory (91B06) Individual preferences (91B08) Partial orders, general (06A06) Utility theory (91B16)

Recommendations

• scientific article; zbMATH DE number 4055680
• scientific article; zbMATH DE number 1554938
• Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
• Numerical representability of semiorders
• Unit representation of semiorders. I: Countable sets

Cites work

• scientific article; zbMATH DE number 3648386 (Why is no real title available?)
• scientific article; zbMATH DE number 3648772 (Why is no real title available?)
• scientific article; zbMATH DE number 3518832 (Why is no real title available?)
• scientific article; zbMATH DE number 3641510 (Why is no real title available?)
• scientific article; zbMATH DE number 3339023 (Why is no real title available?)
• Biorder families, valued relations, and preference modelling
• Interval graphs and interval orders
• Preference modelling
• Pseudo-orders: Definition, properties and numerical representation
• Semiorders and a Theory of Utility Discrimination
• Threshold Representations of Multiple Semiorders
• Threshold-Bounded Interval Orders and a Theory of Picycles

Cited in

(19)

• An algorithmic proof that semiorders are representable
• Synthetic description of a semiorder
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. I: Theory
• A constructivist multiple criteria framework for mortgage risk analysis
• Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. II: Algorithms
• Any complete preference structure without circuit admits an interval representation
• scientific article; zbMATH DE number 1554938 (Why is no real title available?)
• scientific article; zbMATH DE number 4055680 (Why is no real title available?)
• On unit interval graphs with integer endpoints
• Weakened transitive rationality: invariance of numerical representations of preferences
• Continuous representability of semiorders
• Minimal order morphisms
• The representation polyhedron of a semiorder.
• Numerical representability of semiorders
• Unit representation of semiorders. I: Countable sets
• Unit representation of semiorders. II: The general case
• Recognition and characterization of unit interval graphs with integer endpoints
• A Note on Candeal and Induráin’s Semiorder Separability Condition
• On properties of unit interval graphs with a perceptual motivation

This page was built for publication: Minimal representation of a semiorder

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