Page 198 - DCOM303_DMGT504_OPERATION_RESEARCH
P. 198

Unit 9: Game Theory




          5.   How do you solve a game when:                                                    Notes
               (a)  a saddle point exists, and
               (b)  Saddle point does not exist.
          6.   Explain the theory of dominance in the solution of Rectangular games.

          7.   What are the limitations of Game theory?
          8.   Consider the game G with following payoff matrix:
                                                 Player B
             Player A                               B1                  B2
                              A1                    2                    6
                              A2                   –2                    µ

               (a)  Show that G is strictly determinable whatever µ be.
               (b)  Determine the value of G.
          9.   Determine the optimal strategies for each player in the following game:


                                                     
                                                      
                                                      
                                                      
               Ans. [Saddle Pt. is (2, 3) and V = 4 optimum strategy for player A is A  and that for B is B
                                                                       2              3
          10.  Solve the following games:


               (a)
                                             
                                           
                                              
                                            
                                              
                                              


                             
               (b)           
                              
                             

                                
                                 
               (c)               
                              
          11.  Find the saddle point for the following payoff table:

                                      1              2            3            4
                       1              2             –1            0           –3
                       2              2              1            0            3
                       3              –3            –2            1            4








                                           LOVELY PROFESSIONAL UNIVERSITY                                   193
   193   194   195   196   197   198   199   200   201   202   203