Fuzzy Arrovian Theorems when preferences are complete
In this paper we study the aggregation of fuzzy preferences on non-necessarily finite societies. We characterize in terms of possibility and impossibility a family of models of complete preferences in which the transitivity is defined for any t-norm. For that purpose, we have described each model by means of some crisp binary relations and we have applied the results obtained by Kirman and Sondermann.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Generalization of Arrow's Impossibility Theorem Through Combinatorial Topology
To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illumina…
Distributed ComputingEscaping Arrow's Theorem: The Advantage-Standard Model
There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style …
modelOn the Convergence of Sigmoid and tanh Fuzzy General Grey Cognitive Maps
Fuzzy General Grey Cognitive Map (FGGCM) and Fuzzy Grey Cognitive Map (FGCM) are extensions of Fuzzy Cognitive Map (FCM) in terms of uncertainty. FGGCM allows for the processing of general grey number with multiple inter…
Compatible extensions and consistent closures: a fuzzy approach
In this paper $\ast$--compatible extensions of fuzzy relations are studied, generalizing some results obtained by Duggan in case of crisp relations. From this general result are obtained as particular cases fuzzy version…
RelationLogical Fuzzy Preferences
We present a unified logical framework for representing and reasoning about both quantitative and qualitative preferences in fuzzy answer set programming, called fuzzy answer set optimization programs. The proposed frame…
Scheduling