Classifying interdependence in multidimensional binary preferences (Q2427209)

The paper discusses the concept of separability of binary decisions. A mechanism to classify preferences according to the extent to which they achieve or fail to achieve the property of separability is developed. It is shown that the probability of a randomly chosen preference in the a set of binary relations allowing for at least one nontrivial separable set tends to zero as the number of binary relations increases.