Transitivity Preserving Aggregation of Preferences
نویسندگان
چکیده
In this paper we summarize some of our results on aggregation of individual fuzzy preferences. We focus on aggregation functions that preserve some types of transitivity, by giving complete characterization and representation of two main aggregation classes. These are closely related to the weighted maximum and minimum operations. We also establish full characterization of these weighted forms via stability properties of the operations. These properties are expressed by functional equations. Solutions of these equations correspond exactly to the studied operations.
منابع مشابه
Title Arrow ' s theorem and max - star transitivity
In the literature on social choice with fuzzy preferences, a central question is how to represent the transitivity of a fuzzy binary relation. Arguably the most general way of doing this is to assume a form of transitivity called max-star transitivity. The star operator in this formulation is commonly taken to be a triangular norm. The familiar max-min transitivity condition is a member of this...
متن کاملArrow's theorem and max-star transitivity
In the literature on social choice with fuzzy preferences, a central question is how to represent the transitivity of a fuzzy binary relation. Arguably the most general way of doing this is to assume a form of transitivity called max-star transitivity. The star operator in this formulation is commonly taken to be a triangular norm. The familiar max-min transitivity condition is a member of this...
متن کاملIndividual-valued preferences and their aggregation: consistency analysis in a real case
In this paper we have analyzed the accomplishment of several consistency conditions in a real decision case. A group of students showed their intensities of preference among the alternatives by means of linguistic labels represented by real numbers. The absolute and relative fulfillments of some kinds of fuzzy transitivity properties have been studied for individual and collective preferences. ...
متن کاملComputation of median orders: complexity results
Given a set of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizing the number of disagreements with respect to the given set and verifying some structural properties like transitivity. We study the complexity of this problem when the individual preferences as well as the collective one must verify...
متن کاملArrow’s Theorem Without Transitivity
In light of research indicating that individual behavior may violate standard rationality assumptions, we introduce a model of preference aggregation in which neither individual nor collective preferences must satisfy transitivity or other coherence conditions. We introduce an ordinal rationality measure to compare preference relations. Using this measure, we introduce a new axiom, monotonicity...
متن کامل