In Problem derive the formulas of Theorem 4 for the solution of any 2 × 2 nonstrictly determined matrix game by rewriting and analyzing

(A) Let p₂ = 1 – p₁ and q₂ = 1 – q₁ and simplify (4) to show that

(B) Show that if p₁ is chosen so that Dp₁ – (d – c) = 0, then

regardless of the value of p₁.

Data from Theorem 4

Transcribed Image Text:

E(P, Q): = apıq₁ +bpiq2 + cp291 + dp292 (4)