An algorithmic proof that semiorders are representable

DOI10.1016/0196-6774(92)90010-AMaRDI QIDQ3990620zbMATH OpenOpenAlexFDO

Authors P. J. Avery

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90010-a

zbMATH Keywords

semiorderasymmetric digraphpreference patterns with intransitive indifference

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Numerical representability of semiorders
• Scott-suppes representability of semiorders: Internal conditions
• Minimal representation of a semiorder
• Unit representation of semiorders. I: Countable sets
• Semiorders and thresholds of utility discrimination: solving the Scott-Suppes representability problem

Cited in

(4)

• scientific article; zbMATH DE number 4154501 (Why is no real title available?)
• Scott-suppes representability of semiorders: Internal conditions
• Unit representation of semiorders. I: Countable sets
• Threshold Representations of Multiple Semiorders

This page was built for publication: An algorithmic proof that semiorders are representable

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