Hi, suppose two players are a playing a game with a non-square payoff matrix, like for example this one:(adsbygoogle = window.adsbygoogle || []).push({});

.....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..

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# I Game Theory: Strategy for game with non-square payoff matrix

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Game Theory Strategy | Date |
---|---|

About the strategy of reducing the total suffering in a queue | Dec 28, 2017 |

I Stochastic Minimax partition problem card game | Sep 1, 2017 |

Is Game Theory a Self-Contained Subject? | Feb 18, 2016 |

Game theory -- Nash equilibrium | Dec 1, 2014 |

Notation for mixed strategies in Game Theory | May 16, 2008 |

**Physics Forums - The Fusion of Science and Community**