Aggregation of Coarse Preferences ∗

We consider weak preference orderings over a set An of n alternatives. An individual preference is of refinement f ≤ n if it first partitions An into f subsets of ‘tied’ alternatives, and then ranks these subsets within a linear ordering. When f < n, preferences are coarse. It is shown that, if the refinement of preferences does not exceed f, a super majority rule (within non-abstaining voters) with rate 1 − 1/f is necessary and sufficient to rule out Condorcet cycles of any length. It is argued moreover how the coarser the individual preferences, (1) the smaller the rate of super majority necessary to rule out cycles ‘in probability’; (2) the more probable the pairwise comparisons of alternatives, for any given super majority rule