15. Use the following election to show that sequential pairwise voting is manipulable. (Assume that the agenda is , , and .)
15.
| Election 1 | |||
| Rank | Number of voters (3) | ||
| 1 | 1 | 1 | |
| First | |||
| Second | |||
| Third | |||
Thus, is the winner with sequential pairwise voting and the agenda , , . But the winner becomes if the leftmost voter changes his or her ballot to , , .