Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    Major Core 12 - Optimization Techniques Ii No

    Uploaded by

    RobertBellarmine
    This document discusses dominance rules for solving games with no saddle point. It contains: - 6 multiple choice questions about dominance rules and their applications in reducing payoff matrices - 3 very short answer questions asking about dominance rules and how to solve games when rules don't directly apply - 3 problems asking to use dominance rules to solve sample games - 2 explanatory questions solving games using dominance rules Dominance rules help reduce strategies and the size of a payoff matrix by eliminating dominated strategies. They are applicable when a game has no saddle point and can reduce it to order 2x2.

    Copyright:

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

    Major Core 12 - Optimization Techniques Ii No

    Uploaded by

    RobertBellarmine
    32 views4 pages
    This document discusses dominance rules for solving games with no saddle point. It contains: - 6 multiple choice questions about dominance rules and their applications in reducing payoff matrices - 3 very short answer questions asking about dominance rules and how to solve games when rules don't directly apply - 3 problems asking to use dominance rules to solve sample games - 2 explanatory questions solving games using dominance rules Dominance rules help reduce strategies and the size of a payoff matrix by eliminating dominated strategies. They are applicable when a game has no saddle point and can reduce it to order 2x2.

    Original Description:

    Original Title

    1.4.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses dominance rules for solving games with no saddle point. It contains: - 6 multiple choice questions about dominance rules and their applications in reducing payoff matrices - 3 very short answer questions asking about dominance rules and how to solve games when rules don't directly apply - 3 problems asking to use dominance rules to solve sample games - 2 explanatory questions solving games using dominance rules Dominance rules help reduce strategies and the size of a payoff matrix by eliminating dominated strategies. They are applicable when a game has no saddle point and can reduce it to order 2x2.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    32 views4 pages

    Major Core 12 - Optimization Techniques Ii No

    Uploaded by

    RobertBellarmine
    This document discusses dominance rules for solving games with no saddle point. It contains: - 6 multiple choice questions about dominance rules and their applications in reducing payoff matrices - 3 very short answer questions asking about dominance rules and how to solve games when rules don't directly apply - 3 problems asking to use dominance rules to solve sample games - 2 explanatory questions solving games using dominance rules Dominance rules help reduce strategies and the size of a payoff matrix by eliminating dominated strategies. They are applicable when a game has no saddle point and can reduce it to order 2x2.

    Copyright:

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

    MAJOR CORE 12

    - OPTIMIZATION TECHNIQUES II

    No. of Hours: 6

    No. of Credits: 5

    Code: U08MA6MCT15

    1.4-dominance rules
    Code: U08MA6MCT15

    Level: K

    Unit :1.4

    Type: MC

    1. When a game with payoff matrix of order

    mn

    has no saddle point ,it

    can be solved by
    (a) Maxmin-minmax principle
    ( c ) graphical method

    (b) algebraic method


    (d) dominance rules

    2. Dominance rules helps in


    (a) solving the game by always finding a saddle point
    (b) by always reducing the payoff matrix to order
    ( c ) by

    22

    reducing the strategies to 2 for at least one of the players

    (d) by reducing the payoff matrix to any order.


    Code: U08MA6MCT15

    Level: U

    Unit :1.4

    Type: MC

    1.

    The reduced payoff matrix by applying dominance rules for the payoff
    matrix
    5 -2
    12 15

    14 10

    (a)

    is

    12 15
    14 10

    (b)

    5 -2
    14 10

    (c)

    12 15
    14 10

    5
    (d)

    Code: U08MA6MCT15

    Level: K

    Unit :1.4

    Type: VSA

    1.
    2.
    3.

    1.

    State dominance rules in solving a game.


    When are dominance rules applicable in a game?
    When dominance rules are not applicable directly, how to solve the
    game?
    Code: U08MA6MCT15

    Level: U

    Unit :1.4

    Type: VSA

    Write the reduced payoff matrix to the matrix


    4 -2 3 -1
    -1 2 0 1

    -2 1 -2 0

    by applying dominance rules once.

    Code: U08MA6MCT15

    Level: U

    Unit :1.4

    Type: PA

    1. Use dominance rules and solve the game given the payoff matrix
    Player B

    Player A

    II

    III

    IV

    II

    III

    IV

    2.

    Solve the game by using the dominance rules whose payoff matrix is
    50
    70

    28
    45

    75 47.5 50

    3.

    40
    50

    Solve the game by using the dominance rules whose payoff matrix is
    60 50 40
    70 70 50

    80 60 75

    1.

    Code: U08MA6MCT15

    Level: U

    Unit :1.4

    Type: E

    Use dominance properties by explaining in detail and solve the game


    Player B

    Player A

    II

    III

    IV

    -2

    II

    12

    III

    -3

    IV

    -3

    2.

    Use dominance properties by explaining in detail and solve the game


    Player B

    Player A

    3.

    B1

    B2

    B3

    B4

    A1

    -2

    -1

    A2

    -1

    A3

    -2

    -2

    You might also like