ps2(2010)_soln_v2

ps2(2010)_soln_v2 - MS&E 246: Game Theory with...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: MS&E 246: Game Theory with Engineering Applications Feryal Erhun Winter, 2010 Problem Set # 2 Solutions 1. (20pts)(5pts for identifying the expected payoff at a bid, 10 pts for finding out the prob- abilities that can be observed in an equilibrium/showing that p ( b i ) = 1 100 works leads to the same expected payoff for each bid, 5 pts for arguing/verifying that no other probability distribution can make the player better off) (All calculations are in cents.) Player i mixes between 0 , 1 , 2 ,..., 99 where p ( b i ) denotes the probability that player i bids b i { , 1 , 2 ,..., 99 } . Player i s payoff is then U i ( b i ) = (100- b i ) Prob ( b i > b j )- b i Prob ( b i b j ) . Consider the following symmetric mixed strategies: p ( b i ) = 1 100 for all b i , 1 , 2 ,..., 99 for all i 1 , 2 . In order to verify that the above strategy is a mixed strategy equilibrium in which every bid less than 100 has a positive probability, observe that when player i uses this strategy her payoff would be U i ( b i ) = (100- b i ) b i 100- b i 1- b i 100 = 0 for all b i { , 1 , 2 ,..., 99 } . Finally, note that playing with some other probability distribution over { 0,1,2,...,99 } cannot make player i better off. 2. (5 pts for each part, 25 pts total) 1. The payoff of each student must be nonnegative, since a student can not download a negative number of files. Each student is allowed a maximum download amount of 100, so 10 1 100 and 20 2 100. The total amount that can be downloaded from the university is 150, so 10 1 + 20 2 150. So the set of achievable payoffs is defined by the following inequalities: 1 10 2 5 1 + 2 2 15 1 2. The Pareto efficient pairs are the payoffs that satisfy, 5 1 10 2 . 5 2 5 1 + 2 2 = 15 3. The max-min fair payoff pair is (5,5). At any other achievable payoff pair either 1 < 5 or 2 < 5....
View Full Document

Page1 / 5

ps2(2010)_soln_v2 - MS&E 246: Game Theory with...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online