Fuzzy Arrovian theorems when preferences are strongly-connected

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 strongly-connected 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 about ultrafilters and Arrovian models.

Keywords:

Mathematical social choice , fuzzy preferences , arrovian models in the fuzzy setting , strongly-connected preferences , Defuzzification , coalitions , ultrafilters , infinite agents