We introduce two extreme methods to pairwisely compare ordered lists of the same length, viz. the comonotonic and the countermonotonic comparison method, and show that these methods are, respectively, related to the copula T M (the minimum operator) and the Ł ukasiewicz copula T L used to join marginal cumulative distribution functions into bivariate cumulative distribution functions. Given a collection of ordered lists of the same length, we generate by means of T M and T L two probabilistic relations Q (...) M and Q L and identify their type of transitivity. Finally, it is shown that any probabilistic relation with rational elements on a 3-dimensional space of alternatives which possesses one of these types of transitivity, can be generated by three ordered lists and at least one of the two extreme comparison methods. (shrink)

We introduce the notion of a dice model as a framework for describing a class of probabilistic relations. We investigate the transitivity of the probabilistic relation generated by a dice model and prove that it is a special type of cycle-transitivity that is situated between moderate stochastic transitivity or product-transitivity on the one side, and Lukasiewicz-transitivity on the other side. Finally, it is shown that any probabilistic relation with rational elements on a three-dimensional space of alternatives which possesses this particular (...) type of cycle-transitivity, can be represented by a dice model. The same does not hold in higher dimensions. (shrink)