An IC model-based fusion operator selects, among the models of IC, those that are preferred, where the preference relation depends on the operator that is used.
A Top-k model is defined as a model with less than k models preferred to it with respect to a preference relation.
In what follows, \ \preceq\) represents a weak preference relation, i.e., the relation "… is not preferred to …".
The symbol ≺ shall represent the preference relation.
Consequently, this paper introduces the concepts of incomplete hesitant fuzzy preference relation, acceptable incomplete hesitant fuzzy preference relation, and additive consistent incomplete hesitant fuzzy preference relation.
Let \(S\) be a finite set, and \ \preceq\) a weak preference relation on \(S\).
Two alternatives are called "incomparable" whenever the preference relation is incomplete with respect to them.
A weak preference relation ≽ is called quasi-transitive if its strict part ≻ is transitive.
In preference-to-preference procedures, the outcome is a preference relation over the set of alternatives.
A lexicographic preference relation gives absolute priority to one good over another.
Often, this framework yields a preference relation over actions much like the simple case.
