Any complete preference structure without circuit admits an interval representation
From MaRDI portal
Publication:1908002
Recommendations
Cites work
- scientific article; zbMATH DE number 3853140 (Why is no real title available?)
- scientific article; zbMATH DE number 3912431 (Why is no real title available?)
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 6009 (Why is no real title available?)
- scientific article; zbMATH DE number 781783 (Why is no real title available?)
- scientific article; zbMATH DE number 849083 (Why is no real title available?)
- scientific article; zbMATH DE number 867635 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- 2-Competition Graphs
- General results on tolerance intersection graphs
- Interval graphs and interval orders
- Intransitive indifference with unequal indifference intervals
- Lexicographic aggregation of semiorders
- Minimal representation of a semiorder
- Niche graphs
- Niche numbers
- Preference modelling
- Preference structures and threshold models
- Some recent results on niche graphs
- Stability number and chromatic number of tolerance graphs
- Synthetic description of a semiorder
- The competition-common enemy graph of a digraph
- Tolerance graphs
Cited in
(5)
This page was built for publication: Any complete preference structure without circuit admits an interval representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908002)