Any complete preference structure without circuit admits an interval representation

DOI10.1007/BF01078980zbMath0845.90006OpenAlexW1995058389MaRDI QIDQ1908002

Moncef Abbas

Publication date: 28 February 1996

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

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

zbMATH Keywords

tolerance graphspreference modellingtolerance functioncomplete preference structurestolerance interval orders

Mathematics Subject Classification ID

Decision theory (91B06) Individual preferences (91B08)

Related Items (4)

Biased extensive measurement: the general case ⋮ Tangent circle graphs and `orders' ⋮ The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties ⋮ Preference structures and their numerical representations

Cites Work

• Some recent results on niche graphs
• Tolerance graphs
• Interval graphs and interval orders
• Preference modelling
• The competition-common enemy graph of a digraph
• Niche graphs
• Synthetic description of a semiorder
• Stability number and chromatic number of tolerance graphs
• Minimal representation of a semiorder
• Intransitive indifference with unequal indifference intervals
• General results on tolerance intersection graphs
• Niche numbers
• 2-Competition Graphs
• Lexicographic aggregation of semiorders
• Preference structures and threshold models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Any complete preference structure without circuit admits an interval representation