- #1

- 173

- 29

.....a.......b...

A: (1,3) (1,0

B: (0,0) (2,1)

C: (3,1) (0,3)

How would one go about finding an optimal mixed strategy for something like this? I mean, if this was a 3x3 matrix then one could find an optimal mixed strategy for each player by defining it as optimal when it gives equal expected payoff regardless of the opponent's choice, however this isn't possible when it's 3x2.

The only thing I can think of is by eliminating one of the rows (my intuition says that the 2nd row in the example above seems like a good candidate to remove) and making it 2x2, but I don't know how to logically go about this..