1. Spatial model with 3 policy choices: Consider three policy options that will be voted on in round-robin tournaments by 11 voters arranged on the following unidimensional policy space: To nodmam You Jed ideal points of 11 voters 10 on11 d "29969 Pa Pb Pc policy proposals Figure out which policy is closest for each of the 11 voters by determining the distance between the voter's ideal policy and each policy proposal. We assume that each voter has single-peaked and symmetric utility functions so that they prefer the policy choice that is closest to their ideal point. canimmoo arti esod . Circle the closest distance to determine which policy each voter will vote for. Voter distance distance distance bonsne voilog lem ers to P to P to Pc 1 2 3 4 bedonne. vollog laniforly 5 nmoo ardi 2900 .vi 6 7 8 9 botpens voilog lani er 10 immos er) 2900 .v 11 If the policy that had the most first-place votes (circled distances) won, which policy would be enacted: 1 no X nc ward . Slid 6 seogorq sstilmmos ards 2900 iv Round robin results (vote totals): Pa VS Pb Pa VS Pc Pb VS Pc Is there a Condorcet winner (a policy that defeats all other policies)