
406 a tool kit for voting theory
have one voter preferring one set of candidates, another preferring the opposite
committee, and the third voter breaks the tie with his {Alice, Connie, Elaine} choice:
it is difficult to argue against the outcome here. The last possibility has the voter
preferences {Alice, Connie, Florence}, {Alice, Diane, Elaine}, and {Barb, Connie,
Elaine}. But even here the outcome is supported by 2 : 1 votes.
To introduce doubt, suppose the last possibility is the actual vote and it captures the
voters’ intent to include at least one candidate from the top and bottom lines; maybe
these lines are distinguished by race and the deans wanted a mixed-race committee:
Sciences Engineering Arts
Black Alice Connie Elaine
White
Barb Diane Florence
(9)
If so, then even though each voter voted consistently with this objective, the outcome
violated their intent. This undesired choice is no surprise because the pairwise vote,
and any binary independence rule, only examines a particular pair. It cannot, and
does not, reflect intended relationships among the pairs. It is unrealistic to expect a
voting rule that satisfies binary independence to do this extra duty.
Now alter the example with a name change involving the binary rankings
of A, B, C. Namely replace Alice with A B, Barb with B A, Connie with
B C,DianewithC B, Elaine with C A, and Florence with A C. With
this name change, the “mixed-race rankings” become transitive rankings,whilethe
“single race committees” are cyclic rankings. Moreover, the voter rankings {Alice,
Connie, Florence}, {Alice, Diane, Elaine}, and {Barb, Connie, Elaine} become the
Condorcet triplet {A B C, B C A, C A B}. Because the two exam-
ples differ only by a name change, any comment about the dean selection problem
applies to voting over pairs. In particular, because binary independence strips any
mixed-race intended relationship from the first problem, Arrow’s theorem occurs
because binary independence strips away the intended “transitivity” relationship! (This
is made precise in Saari 2001b.)
By recognizing that binary independence strips away the intended transitivity
relationship from preferences, we can rectify the problem: find ways to reintroduce
the transitivity information. By doing so, positive assertions are forthcoming; e.g. the
Borda Count replaces Arrow’s dictator. Incidentally, a similar explanation holds for
Sen’s theorem.
8 Conclusion
.............................................................................
The message of this chapter is that the beautiful results in voting theory and social
choice can add an important dimension to our understanding of the strengths and
weaknesses of decision rules. While a technical understanding is helpful, it is not
necessary. Even developing a basic intuition, which I tried to provide, can eliminate
misinterpretations and help us address more subtle election properties.