Threshold Representations of Multiple Semiorders

DOI10.1137/0608005MaRDI QIDQ3754035zbMATH OpenOpenAlexFDO

Authors Jean-Paul Doignon

Publication date 1987

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0608005

zbMATH Keywords

representation theoremthresholdssemiorders

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Mathematical psychology (91E99) Utility theory (91B16)

Recommendations

• On numerical representations of semiorders
• scientific article; zbMATH DE number 827980
• Semimetric thresholds for finite posets
• Semiorders. Properties, representations, applications
• Numerical representability of semiorders
• A Representation Theorem for Semilattices
• Continuous semiorder representations
• Continuous representability of semiorders
• Double threshold orders: a new axiomatization
• An algorithmic proof that semiorders are representable

Cites work

• scientific article; zbMATH DE number 3860950 (Why is no real title available?)
• scientific article; zbMATH DE number 3742961 (Why is no real title available?)
• Biorder families, valued relations, and preference modelling
• Convex Analysis
• Double Semiorders and Double Indifference Graphs
• Foundational aspects of theories of measurement
• Homogeneous families of semiorders and the theory of probabilistic consistency
• Intransitive indifference with unequal indifference intervals
• Measurement Theory
• Measurement structures and linear inequalities
• Preference modelling
• Pseudo-orders: Definition, properties and numerical representation
• Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results
• Semiorders and a Theory of Utility Discrimination

Cited in

(20)

• scientific article; zbMATH DE number 4154501 (Why is no real title available?)
• Synthetic description of a semiorder
• An interactive algorithm to deal with inconsistencies in the representation of cardinal information
• A simple proof characterizing interval orders with interval lengths between 1 and \(k\)
• A characterization of the 2-additive Choquet integral through cardinal information
• On the preservation of semiorders from the fuzzy to the crisp setting
• Generalizations of semiorders: A review note
• Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem
• \(T\)-colorings of graphs: recent results and open problems
• Universal semiorders
• Aggregation of semiorders: Intransitive indifference makes a difference
• Bi-semiorders with frontiers on finite sets
• Numerical representations of imperfectly ordered preferences (A unified geometric exposition)
• Representing interval orders by weighted bases: some complexity results
• Numerical representability of semiorders
• Minimal representation of a semiorder
• Unit representation of semiorders. I: Countable sets
• Unit representation of semiorders. II: The general case
• Rough approximation of a preference relation by dominance relations
• A genesis of interval orders and semiorders: transitive NaP-preferences

This page was built for publication: Threshold Representations of Multiple Semiorders

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