Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    Publication 5 13656 31

    Uploaded by

    Sikakolli Venkata Siva Kumar
    This document discusses game theory and methods for solving games with mixed strategies. It provides three methods - analytical, graphical, and simplex - for solving games where no pure strategy saddle point exists. The analytical method can be used for 2x2 games, the graphical method for 2x2, mx2, and 2xn games, and the simplex method for larger games. Examples are provided of using the analytical and graphical methods to solve sample 2x2 and mx2 games.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Publication 5 13656 31

    Uploaded by

    Sikakolli Venkata Siva Kumar
    39 views7 pages
    This document discusses game theory and methods for solving games with mixed strategies. It provides three methods - analytical, graphical, and simplex - for solving games where no pure strategy saddle point exists. The analytical method can be used for 2x2 games, the graphical method for 2x2, mx2, and 2xn games, and the simplex method for larger games. Examples are provided of using the analytical and graphical methods to solve sample 2x2 and mx2 games.

    Original Description:

    A

    Original Title

    publication_5_13656_31

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses game theory and methods for solving games with mixed strategies. It provides three methods - analytical, graphical, and simplex - for solving games where no pure strategy saddle point exists. The analytical method can be used for 2x2 games, the graphical method for 2x2, mx2, and 2xn games, and the simplex method for larger games. Examples are provided of using the analytical and graphical methods to solve sample 2x2 and mx2 games.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    39 views7 pages

    Publication 5 13656 31

    Uploaded by

    Sikakolli Venkata Siva Kumar
    This document discusses game theory and methods for solving games with mixed strategies. It provides three methods - analytical, graphical, and simplex - for solving games where no pure strategy saddle point exists. The analytical method can be used for 2x2 games, the graphical method for 2x2, mx2, and 2xn games, and the simplex method for larger games. Examples are provided of using the analytical and graphical methods to solve sample 2x2 and mx2 games.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 7

    Lecture 21

    Game Theory :
    Games with Mixed Strategies
    ( analytic and graphic methods )

    21.1 Games with Mixed Strategies


    In certain cases, no pure strategy solutions exist for the game. In other words, saddle point does
    not exist. In all such game, both players may adopt an optimal blend of the strategies called
    Mixed Strategy to find a saddle point. The optimal mix for each player may be determined by
    assigning each strategy a probability of it being chosen. Thus these mixed strategies are
    probabilistic combinations of available better strategies and these games hence called
    Probabilistic games.

    The probabilistic mixed strategy games without saddle points are commonly solved by any of the
    following methods

    Sl.
    Method Applicable to
    No.
    1 Analytical Method 2x2 games
    2 Graphical Method 2x2, mx2 and 2xn games
    3 Simplex Method 2x2, mx2, 2xn and mxn games

    21.1.1 Analytical Method


    A 2 x 2 payoff matrix where there is no saddle point can be solved by analytical method.
    Given the matrix

    Value of the game is

    With the coordinates

    Alternative procedure to solve the strategy

    1
    Find the difference of two numbers in column 1 and enter the resultant under column 2.
    Neglect the negative sign if it occurs.
    Find the difference of two numbers in column 2 and enter the resultant under column 1.
    Neglect the negative sign if it occurs.
    Repeat the same procedure for the two rows.

    1. Solve

    Solution
    It is a 2 x 2 matrix and no saddle point exists. We can solve by analytical method

    V = 17 / 5
    SA = (x1, x2) = (1/5, 4 /5)
    SB = (y1, y2) = (3/5, 2 /5)

    2. Solve the given matrix

    Solution

    V=-1/4
    SA = (x1, x2) = (1/4, 3 /4)
    SB = (y1, y2) = (1/4, 3 /4)

    2
    21.1.2 Graphical method
    The graphical method is used to solve the games whose payoff matrix has
    Two rows and n columns (2 x n)
    m rows and two columns (m x 2)

    Algorithm for solving 2 x n matrix games

    Draw two vertical axes 1 unit apart. The two lines are x1 = 0, x1 = 1
    Take the points of the first row in the payoff matrix on the vertical line x1 = 1 and the
    points of the second row in the payoff matrix on the vertical line x1 = 0.
    The point a1j on axis x1 = 1 is then joined to the point a2j on the axis x1 = 0 to give a
    straight line. Draw n straight lines for j=1, 2 n and determine the highest point of the
    lower envelope obtained. This will be the maximin point.
    The two or more lines passing through the maximin point determines the required 2 x 2
    payoff matrix. This in turn gives the optimum solution by making use of analytical
    method.

    Example 1
    Solve by graphical method

    Solution

    3
    V = 66/13
    SA = (4/13, 9 /13)
    SB = (0, 10/13, 3 /13)

    Example 2

    Solve by graphical method

    Solution

    V = 8/7
    SA = (3/7, 4 /7)
    SB = (2/7, 0, 5 /7)

    Algorithm for solving m x 2 matrix games

    Draw two vertical axes 1 unit apart. The two lines are x1 =0, x1 = 1

    4
    Take the points of the first row in the payoff matrix on the vertical line x1 = 1 and the
    points of the second row in the payoff matrix on the vertical line x1 = 0.
    The point a1j on axis x1 = 1 is then joined to the point a2j on the axis x1 = 0 to give a
    straight line. Draw n straight lines for j=1, 2 n and determine the lowest point of the
    upper envelope obtained. This will be the minimax point.
    The two or more lines passing through the minimax point determines the required 2 x 2
    payoff matrix. This in turn gives the optimum solution by making use of analytical
    method.

    Example 1
    Solve by graphical method

    Solution

    5
    V = 3/9 = 1/3
    SA = (0, 5 /9, 4/9, 0)
    SB = (3/9, 6 /9)

    Example 2

    Solve by graphical method

    Solution

    6
    V = 73/17
    SA = (0, 16/17, 1/17, 0, 0)
    SB = (5/17, 12 /17)

    You might also like