Let % denote a binary relation on a product set X = X1 × X2 × · · · × Xn. Conjoint measurement searches for conditions that allow numerical representations of % to be built and possibly guarantee the uniqueness of such representations. The interest of numerical representations is obvious. They not only facilitate the manipulation of preference relations but also, in many cases, the proofs that ...

Translation of Classical Dimension Theory into a valued context should allow a comprehensible view of alternatives, by means of an informative representation, being this representation still manageable by decision makers. In fact, there is an absolute need for this kind of representations, since being able to comprehend a valued preference relation is most of the time the very first difficulty ...

The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality and the preservation of strict partial orders are crucial for contractions. Contractions can be further constrained by specifying which preferences should be p...

Inspired by the idea of multiplicative intuitionistic preference relation (Xia MM et al. Preference relations based on intuitionistic multiplicative information, IEEE Transactions on Fuzzy Systems, 2013, 21(1): 113-133), in this paper, a new preference relation called the interval-valued multiplicative intuitionistic preference relation is developed. It is analyzed the basic operations for inte...

The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator maps a family of relations to a single relation which represents their lexicographic combination according to a certain priority on the family of relations. We present four kinds of results. We show that the lexicographi...

Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a new epistemic input. While most such possible world semantics rely on a single ordering, we investigate the use of an additional preference ordering—representing, for instance, the epistemic context the agent finds itsel...

The aim of this paper is to present a model of Mobile Decision Support System where the preferences about alternatives can be provided, by the experts using Mobile Internet devices such as mobile phones or PDAs. Experts’ preferences can be represented using different preference elements: preference orderings, fuzzy preference relations, multiplicative preference relations and utility functions....

We focus on the Ferrers property of fuzzy preference relations. We study the connection between the Ferrers property and fuzzy interval orders. A crisp total interval order is characterized by the Ferrers property of its strict preference relation. Also, a crisp preference structure is a total interval order if and only if its large preference relation satisfies the Ferrers property. For fuzzy ...

This paper is devoted to construction of fuzzy preference relations and to showing how this construction is connected with Lukasiewicz filters and TL-evaluators. We will study also extensions of Lukasiewicz filters on subsets of some X 6= ∅ to TL-evaluators on the system (lattice) of fuzzy functions f : X → [0, 1].

Paper TRACKING NUMBER: 496 ABSTRACT A fuzzy model is presented for representing ordered and incomparable preferences over alternatives. In this model a user’s preference can change dynamically through a gradual transition between any of the strict, indifferent and incomparable class of preference structures. This transition is defined as a function of demand levels on the inclusion of one alter...