problemset1

# problemset1 - Problem Set 1 Ben Polak Econ 159a/MGT522a...

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

Problem Set 1 Ben Polak, Econ 159a/MGT522a. Four Questions due September 19, 2007. 1. Strictly and Weakly Dominated Strategies? example of a two-player game matrix where one player has three strategies, one of which is strictly dominated; and the other player has three strategies, one of which is weakly (but not strictly) dominated. Indicate the dominated strategies. 2. Iterative Deletion of (weakly) Dominated Strategies Consider the following two-player game 2 l c r T 1 ; 1 0 ; 1 3 ; 1 1 M 1 ; 0 2 ; 2 1 ; 3 D 1 ; 3 3 ; 1 2 ; 2 (a) Are there any strictly dominated strategies? Are there any weakly dominated strategies? If so, explain what dominates what and how. (b) After deleting any strictly or weakly dominated strategies, are there any strictly or weakly dominated strategies in the ‘reduced’ game? If so, explain what dominates what and how. What is left? (c)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/13/2012 for the course ECON 159 taught by Professor Benjaminpolak during the Fall '08 term at Yale.

### Page1 / 2

problemset1 - Problem Set 1 Ben Polak Econ 159a/MGT522a...

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

View Full Document
Ask a homework question - tutors are online