Problem Set 1 Question 1, 2 - OR4350 Introduction to Game...

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

View Full Document Right Arrow Icon
OR4350 Introduction to Game Theory Spring 2010 Problem Set #1 Due : Wednesday, February 10, 2010 at noon in the dropbox (on 2 nd floor of Rhodes Hall) Reminder : Write your Section and NetID on the first page of your homework!!! Answers must always include complete explanations/justifications. 1. Binmore, Section 2.12, Number 1(a)-(e) and 6. (a) [4] Since there are 3 actions for player I at node a , 2 actions at node d , and 2 actions at node e , player I has a total of 3×2×2=12 pure strategies. Since there are 3 available actions for player II at node b and 3 actions at node c , player II has a total of 3×3=9 pure strategies. (b) [4] The 12 pure strategies of player I can be labeled: lll, llr, lrl, lrr, mll, mlr, mrl, mrr, rll, rlr, rrl, rrr. The 9 pure strategies of player II can be labeled: LL, LM, LR, ML, MM, MR, RL, RM, RR. (c) [4] [rM] (d) [4] The pure strategy pairs are ( rll , LR ), ( rll , MR ), ( rll , RR ), ( rrl , LR ), ( rrl , MR ), ( rrl , RR ). (e) [4] The strategic form of
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 / 3

Problem Set 1 Question 1, 2 - OR4350 Introduction to Game...

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