homework3 - equilibrium Problem 3.4. Let G be a payoff...

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

View Full Document Right Arrow Icon
Nau: Game Theory 1 Updated 9/19/11 Homework 3 Problem 3.1. Using the technique that I demonstrated in class, find the husband’s maxmin strategy in the Battle of the Sexes. Problem 3.2. Using the technique that I demonstrated in class, find the wife’s minmax strategy. Problem 3.3. Show that (1) a strictly dominant strategy must be pure (2) an equilibrium in strictly dominant strategies is a unique Nash
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: equilibrium Problem 3.4. Let G be a payoff matrix, and let G' be the matrix produced by removing a strictly dominated action from G . Show that {Nash equilibria of G } = {Nash equilibria of G' } Problem 3.5. Show that the Hawk-Dove game has a unique Nash equilibrium ( s , s ), where s = {(H, 3/5), (D, 2/5)}...
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