Abstract

This article discusses approaches to the problem of the number of preference orderings that can be constructed from a given set of alternatives. After briefly reviewing the prevalent approach to this problem, which involves determining a partitioning of the alternatives and then a permutation of the partitions, this article explains a recursive approach and shows it to have certain advantages over the partitioning one.