{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}


Assignment5_MATH4321_12S - 5 Suppose p q are equalizing...

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

View Full Document Right Arrow Icon
MATH 4321 Game Theory Spring 2012 Assignment 5 1. Problems II.3.7.3, II.4.7.2, II.5.9.9, II5.9.10(d) 2. Solve the following matrix game using the method of linear programming. 1 3 1 5 3. Given a matrix game suppose p 1 , p 2 are optimal strategies for Player I. Show that tp 1 +(1-t)p 2 is also an optimal strategy for any t such that 0 t 1. 4. For a 2-person 0-sum game, show that the lower value is less than or equal to the upper value.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 5. Suppose , p q are equalizing strategies of Player I and II respectively. Show that , p q   is an equilibrium pair. Mission  : 1. For 3-person 0-sum games, is the Safety Principle still applicable? Is there any Minimax Theorem in this case? 2. Can you prove the Duality Theorem in Linear Programming by using the Minimax Theorem in 2-person 0-sum games?...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online