Skip to content

Latest commit

 

History

History
24 lines (19 loc) · 457 Bytes

2007-72.md

File metadata and controls

24 lines (19 loc) · 457 Bytes
course course_year question_number tags title year
Optimization
IB
72
IB
2007
Optimization
2.I.9C
2007

Consider the game with payoff matrix

$$\left(\begin{array}{lll} 2 & 5 & 4 \\ 3 & 2 & 2 \\ 2 & 1 & 3 \end{array}\right)$$

where the $(i, j)$ entry is the payoff to the row player if the row player chooses row $i$ and the column player chooses column $j$.

Find the value of the game and the optimal strategies for each player.