We introduce feature-based representations of feature-based preferences, that is, preferences over \(2^n\) items, each formed by adding a subset of a set of n optional features to a generic item. Feature-based representation uses a propositional logic-based form of notation and is in many cases much briefer than a straightforward ranking list of items. We then define the feature linkage of a preference relation, a measure of the complexity of the relationships among features. We find the minimum value of feature linkage and upper and lower bounds for the maximum value.
