Fuzzy fusion fairness relations for the evaluation of user preference
Mario Köppen, Jun Okamoto, Aoi Honda · 2011
In this paper, formal representations for user preferences will be provided, which also take fairness in the achievement of probably conflicting goals into account. The analysis of the Bottleneck Flow Control (BFC) algorithm for congestion avoidance in traffic networks will serve as a base to specify extensions of relations among preference sets. In particular, these relations are the lexicographic minimum, the maxmin fairness, and the newly introduced ordered-ordered weighted averaging operator. All of them are shown to become, in a relational sense, maximized by the BFC algorithm. Their further expansion by introducing fuzzy fusion operators in their formal definitions than establishes a comprehensive sets of relations. The application of these relations to the Multiple Relation Analysis (MRA) of subjective video quality evaluation data is demonstrated and gives the conclusion that also fairness criterions are present in such evaluations, at least as a secondary preference criterion.