Home > Operation Research calculators > Game Theory >> Bimatrix method example

11. Bimatrix method example ( Enter your problem )
  1. Method & Example-1 (pure strategy nash equilibrium)
  2. Example-2 (pure strategy nash equilibrium)
  3. Example-3 (no pure strategy nash equilibrium)
Other related methods
  1. Saddle point
  2. Dominance method
  3. Oddment method
  4. Algebraic method
  5. Calculus method
  6. Arithmetic method
  7. Matrix method
  8. 2Xn Games
  9. Graphical method
  10. Linear programming method
  11. Bimatrix method

1. Method & Example-1 (pure strategy nash equilibrium)
(Previous example)
3. Example-3 (no pure strategy nash equilibrium)
(Next example)

2. Example-2 (pure strategy nash equilibrium)





Find Solution of game theory problem using Bimatrix method
Player A\Player BLR
U8,74,6
D6,57,8


Solution:
Player `B`
`L``R`
Player `A``U` 8, 7  4, 6 
`D` 6, 5  7, 8 


Player `B`
`color{green}{L}``color{green}{R}`
Player `A``color{red}{U}` 8 , 7  4 , 6 
`color{red}{D}` 6 , 5  7 , 8 


The cells with both entries underlined represents pure strategy nash equilibrium.
The game has pure strategy nash equilibrium : `{(U,L),(D,R)}`.


This material is intended as a summary. Use your textbook for detail explanation.
Any bug, improvement, feedback then Submit Here



1. Method & Example-1 (pure strategy nash equilibrium)
(Previous example)
3. Example-3 (no pure strategy nash equilibrium)
(Next example)





Share this solution or page with your friends.


 
Copyright © 2024. All rights reserved. Terms, Privacy
 
 

.