This article discusses how to solve a game by the dominance property with mixed strategy. Consider the below game:**Solution:** Find out the row minimum and column maximum values.

Here Minimax value is not equal to Maximin so this game has no saddle point. Now proceed with dominance property to reduce the rows and the columns.

Reducing the row and the column of the game is explained in this article. So, after reducing the rows and the columns, the following game will be left.**Note:** We can also compare the elements of a particular row **X** with an average of two or more other rows and if the elements of row **X** are less than or equal to the corresponding elements after taking the average then delete the row **X** **or** we can also compare the elements of a particular column **X** with an average of two or more columns and if the elements of the column **X** are greater than the corresponding elements after taking the average then delete the column **X**.

Now solving this game using Mixed Strategy, we get,

– Value of the game = 0.76

– Probability of Player A = [9/17, 8/17, 0]

– Probability of Player B = [8/17, 9/17, 0]

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Game Theory (Normal-form Game) | Set 4 (Dominance Property-Pure Strategy)
- Game Theory (Normal form game) | Set 2 (Game with Pure Strategy)
- Game Theory (Normal-form game) | Set 3 (Game with Mixed Strategy)
- Game Theory (Normal-form Game) | Set 6 (Graphical Method [2 X N] Game)
- Game Theory (Normal-form Game) | Set 7 (Graphical Method [M X 2] Game)
- Combinatorial Game Theory | Set 2 (Game of Nim)
- Game Theory (Normal - form game) | Set 1 (Introduction)
- Optimal Strategy for a Game | Set 3
- Optimal Strategy for a Game | DP-31
- Optimal Strategy for a Game | Special Gold Coin
- Optimal strategy for a Game with modifications
- Optimal Strategy for the Divisor game using Dynamic Programming
- Combinatorial Game Theory | Set 1 (Introduction)
- Combinatorial Game Theory | Set 4 (Sprague - Grundy Theorem)
- Minimax Algorithm in Game Theory | Set 3 (Tic-Tac-Toe AI - Finding optimal move)
- Minimax Algorithm in Game Theory | Set 1 (Introduction)
- Minimax Algorithm in Game Theory | Set 2 (Introduction to Evaluation Function)
- Minimax Algorithm in Game Theory | Set 4 (Alpha-Beta Pruning)
- Minimax Algorithm in Game Theory | Set 5 (Zobrist Hashing)
- Combinatorial Game Theory | Set 3 (Grundy Numbers/Nimbers and Mex)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.