we will give new, simpler and shorter proofs of these results, we will generalize some of them.
Preference Structures and Co-comparability Graphs
โ Scribed by Moncef Abbas; Marc Pirlot; Philippe Vincke
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 850 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1057-9214
No coin nor oath required. For personal study only.
โฆ Synopsis
Order structures such as linear orders, weak orders, semiorders and interval orders are often considered as models of a decision maker's preferences. In this paper we introduce and study new order structures characterized by their symmetric part belonging to certain classes of co-comparability graphs. We outline possible interpretations and suggest special representations of these structures and we point out their potential use for approximating relations obtained through a multicriteria aggregation procedure. We provide various characterizations of the new structures (as well as of older ones) in terms of minimal forbidden configurations and by algebraic conditions.
๐ SIMILAR VOLUMES
## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__โ__graph__ (resp., __F__\*โ__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in
A S? stcmaric ropolo~ical approach to the starch for regukrities In molecular properties has been proposed on the basis of the so-c.~llod Con:prubiiir\_r graphs of isvrncric clnsscs of molecules. It is shown that the ordering of the isomeric benzenoid 11) drowrbuns in the comp.xJbiiit& grqhs coincid