PS3 - Problem Set 3 Ying Chen ECN 416 Game Theory Three...

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

View Full Document Right Arrow Icon
Problem Set 3 Ying Chen ECN 416 Game Theory Three questions due Thursday, February 11, at the beginning of class 1. Nash Equilibria and Iterated Deletion Consider the following game.  2 0 1 1 4 2 3 4 1 2 2 3 1 3 0 2 3 0 (a) What strategies survive iterated deletion of strictly dominated strategies? (b) Find the (pure strategy) Nash equilibria of this game. (c) Argue as carefully but as concisely as you can that, in general (not just in this game), strategies that form part of a Nash equilibrium are never eliminated by iterated deletion of strictly dominated strategies. 2. The Sneetches Revisited Asweassumedinc lass ,thereare (2 +1) sneetches and they prefer to have a rarer charcterisic. In particular, assume that if fewer than 1 2 of them have star bellies, then the ones with star bellies have a payo f of 1 while the ones with plain bellies have a payo f of 0 ; if fewer than 1 2 of them have plain bellies, then the ones with plain bellies
Background image of page 1

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

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

Page1 / 2

PS3 - Problem Set 3 Ying Chen ECN 416 Game Theory Three...

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

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