Showing posts with label Graphical method for Game theory. Show all posts
Showing posts with label Graphical method for Game theory. Show all posts

Sunday, 15 December 2013

GRAPHICAL METHOD FOR GAME THEORY

Q1.Solve the following 2 x 3 game graphically

                               Player B
Player A    [ 1          3         11
                    8          5          2]



STEP I :
 A's expected pay off against B's pure move is given by:


B's PURE MOVE                     A's EXPECTED PAY OFF E(P)
     B1                                              E1(P)=8-7P1
     B2                                              E2(P)=5-2P1
     B3                                              E3(P)=2P1+2

STEP II:
Now for the graph consider Axis 1 as  A2 and Axis 2 as A1




STEP III:
The reduced Pay off matrix is given by

          B2           B3    --------> the intersection point
A1 [   3              11       3
A2      5               2]      2     maxmin=3

           5               11
minimax=5

maxmin != minmax
Therefore  there exists no saddle point

P1=9/11          p2=2/11

q1=3/11           q2=8/11


Value of game = 49/11

The optimal Strategy is given by
            [  A1          A2
SA  =      9/11       2/11]

           [  B1          B2       B3
SB =      0             3/11     8/11]


NOTE:
The left out matrix value is given as '0'
For 2 x n matrix find lower envelope, find maximin (maximum values)
For m x 2 matrix find upper envelope, find minimax (minimum values)




GRAPHICAL METHOD FOR GAMES 2 x n / m x 2 MATRIX

Consider the following 2 x n games

           B1       B2 .............Bn
A1 [    a11       a12.............a1n
A2      a21       a22.............a2n]


Let the mixed strategy for Player A is given by
          [  A1        A2
SA =     P1        P2]         such that p1+ p2=1   and p1,p2 >=0


Now the Pure Strategy for A available to B would be as follows

B's PURE MOVE                   A's EXPECTED PAY OFF
    B1                                         E1(P)=a11P1+a21P2
    B2                                         E2(P)=a12P1+a22P2
     .
     .
     .
     .
    Bn                                         En(P)=a1nP1+a2nP2