Solution

ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2018/computational-game-theory/2/c/solution

For each history of the first two votes, voter 3 selects its favourite achievable winner. Writing rows for voter 1's vote and columns for voter 2's vote, the resulting continuation winners are
For example, after votes , voter 3 can make either or win, and prefers ; a vote for would instead produce the tie-break winner .
Voter 2 prefers to to . Optimizing each row therefore gives continuation winners after voter 1's respective choices . Voter 1 prefers to and therefore votes , giving winner in every subgame perfect equilibrium.
Some histories admit several equally good votes, but they produce the same winning candidate. Since each voter strictly ranks the three possible winners, unique outcome under strict outcome preferences makes this winner independent of those action ties. This is backward induction over outcomes, not a claim that the entire equilibrium strategy profile is unique.

New to topics? Read the docs here!