homework5 - {( p , C ), (1 p , R )}, and 2s mixed strategy...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Nau: Game Theory 1 Updated 8/25/11 Problem 5.1: In game tree 1, recall our example of a mixed strategy that is not a behavioral strategy: {(0.6, (A, G)), (0.4, (B, H))} Give an equivalent behavioral strategy. Problem 5.2: In game tree 1, what are the equilibria in mixed strategies? In behavioral strategies? Problem 5.3 : In game tree 2, let 1’s mixed strategy be
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: {( p , C ), (1 p , R )}, and 2s mixed strategy be {( q , U ), (1 q , D )}. Show there is only one Nash equilibrium, at p = q = . Homework 5 a A b c B 8 e (3,8) d f g (5,5) (8,3) E F Agent 2 Agent 1 E F i (2,10) h (1,0) G H Agent 1 Game tree 1: a b c d e f h g (4,2) (3,5) (3,5) (4,2) Game tree 2:...
View Full Document

This note was uploaded on 01/13/2012 for the course CMSC 498T taught by Professor Staff during the Fall '11 term at Maryland.

Ask a homework question - tutors are online