A:  For the setting of Ex. 1.1, prove that if there are n players, then you can not have a team with exactly n-1 players on it.

A:  Find the group preference ranking using pairwise comparison for the class data on which elective you would most like to take.  Do you find an intransitivity paradox or not?

Note:  For #7b you will need to create a new group preference schedule (the table).

B:  Find the group preference ranking using the sequential-voting technique with at least three different orders or setups for the sequence for the class data on which elective you would most like to take.  Note that you get the same answer in each case.  Why will this occur in this case?

C:  Find the group preference ranking using the Borda count method for the class data on which elective you would most like to take.

Typo:  In #21a, the method should be "pairwise comparison and simple-majority decision process" (or what I called the "pairwise method" in class).

Clarification:  In #20c, the question is to determine whether or not there is a bogus preference ranking for E that will result in alternative X being selected as the most preferred.