Then, if the permutation process is compatible, an efficient Social Choice Correspondence should select the alternatives that beat or tie with every other alternative. The following example, due to Caragiannis et al. [1]} shows that even when the permutation process is compatible, the `best' alternative may not coincide under the two dominance relations.
