Preview

Operation research

Powerful Essays
Open Document
Open Document
1665 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Operation research
Unit 3
GAME THEORY
Lesson 27

Learning Objective:



To learn to apply dominance in game theory.
Generate solutions in functional areas of business and management.

Hello students,
In our last lecture you learned to solve zero sum games having mixed strategies.
But...
Did you observe one thing that it was applicable to only 2 x 2 payoff matrices? So let us implement it to other matrices using dominance and study the importance of DOMINANCE

In a game, sometimes a strategy available to a player might be found to be preferable to some other strategy / strategies. Such a strategy is said to dominate the other one(s). The rules of dominance are used to reduce the size of the payoff matrix. These rules help in deleting certain rows and/or columns of the payoff matrix, which are of lower priority to at least one of the remaining rows, and/or columns in terms of payoffs to both the players. Rows / columns once deleted will never be used for determining the optimal strategy for both the players.
This concept of domination is very usefully employed in simplifying the two – person zero sum games without saddle point. In general the following rules are used to reduce the size of payoff matrix.

The RULES follow are:

( PRINCIPLES OF DOMINANCE )

you will have to

Rule 1: If all the elements in a row ( say i th row ) of a pay off matrix are less than or equal to the corresponding elements of the other row ( say j th row ) then the player A

will never choose the i th strategy then we say i th strategy is dominated by j th strategy and will delete the i th row.
Rule 2: If all the elements in a column ( say r th column ) of a payoff matrix are greater than or equal to the corresponding elements of the other column ( say s th column ) then the player B will never choose the r th strategy or in the other words the r th strategy is dominated by the s th strategy and we delete r th column .
Rule 3: A pure strategy may be dominated

You May Also Find These Documents Helpful

  • Satisfactory Essays

    Eco/550 Assignment 3

    • 519 Words
    • 3 Pages

    1. Some games of strategy are cooperative. One example is deciding which side of the road to drive on. It doesn’t matter which side it is as long as everyone chooses the same side. Otherwise, everyone may get hurt.…

    • 519 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    mgmt 451 ch1

    • 14453 Words
    • 83 Pages

    The essential core of strategy is doing the same thing as your rivals but being more effective at it.…

    • 14453 Words
    • 83 Pages
    Satisfactory Essays
  • Powerful Essays

    Gamble, J. E., Strickland III, A. J., & Thompson, Jr., A. A., p 30 (2006). Strategy Winning in the…

    • 2923 Words
    • 12 Pages
    Powerful Essays
  • Powerful Essays

    • Prisoner’s dilemma: an interaction between two strategic actors in which neither actor has an…

    • 3675 Words
    • 15 Pages
    Powerful Essays
  • Good Essays

    When it comes to playing the proverbial, "game," even Einstein knew that knowing the rules was not enough. I believe that in order to truly succeed in any endeavor, one has to apply their knowledge practically, be willing take risks, and operate proactively. Fortunately, I have always had a predisposition to learn with dexterity, so the rules have never been an obstacle for me. Playing the game, however, can potentially be challenging.…

    • 496 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Miss

    • 14570 Words
    • 59 Pages

    |[i]. |A payoff matrix shows the set of possible rates of return on an investment, along with their probabilities of occurrence, and the |…

    • 14570 Words
    • 59 Pages
    Satisfactory Essays
  • Good Essays

    Problem Set 1

    • 739 Words
    • 3 Pages

    1. Strictly and Weakly Dominated Strategies? What is the de nition of a strictly dominated strategy? What is the de nition of a weakly dominated strategy? Give an example of a two-player game matrix where one player has three strategies, one of which is strictly dominated; and the other player has three strategies, one of which is weakly (but not strictly) dominated. Indicate the dominated strategies. 2. Iterative Deletion of (weakly) Dominated two-player game 2 l c T 1; 1 0; 1 1 M 1; 0 2; 2 D 1; 3 3; 1 Strategies Consider the following r 3; 1 1; 3 2; 2…

    • 739 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Games: is a transaction that occurs on two levels, it follows a predictable pattern and has a payoff…

    • 572 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    any conditions. The following payoff table shows the profit or loss that could result from each…

    • 392 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Sql Cheat Sheet

    • 594 Words
    • 3 Pages

    * CHECK Constraint: The CHECK constraint ensures that all values in a column satisfy certain conditions.…

    • 594 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Possibility 3: VB > VA >110, B wins the bid but his payoff (110- VA ) is negative.Thus he would have been better off if he had bid 110.…

    • 392 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Ultimatum Game

    • 403 Words
    • 2 Pages

    Thus the game has 2 subgame perfect equilibria - one in which P1 offers 0 and P2 accepts all offers;…

    • 403 Words
    • 2 Pages
    Satisfactory Essays
  • Powerful Essays

    1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. *13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. *28. *29. *30. 31. 32. 33. 34. Simplex short answer Simplex discussion short answer Simplex short answer Simplex short answer Simplex short answer Simplex short answer 4 tableaus 2 tableaus 3 tableaus 3 tableaus 2 tableaus 5 tableaus 5 tableaus 5 tableaus 6 tableaus 4 tableaus 3 tableaus 3 tableaus 3 tableaus Simplex short answer 3 tableaus 4 tableaus graphical analysis 2 tableaus 2 tableaus 6 tableaus 5 tableaus graphical analysis Mixed constraint model transformation Mixed constraint model transformation 5 tableaus 3 tableaus 3 tableaus 4 tableaus 50. 51. 52. 53. 54. *49. *47. *48. 46. 44. 45. 43. 35. 36. 37. 38. 39. 40. 41. *42. 3 tableaus, multiple optimal 4 tableaus 3 tableaus, multiple optimal 2 tableaus, infeasible 2 tableaus, unbounded 4 tableaus, pivot row and column ties, multiple optimal Infeasible problem Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Dual formation and interpretation, sensitivity analysis Sensitivity analysis, cj and qi Sensitivity analysis with duality Sensitivity analysis with duality Sensitivity analysis with duality…

    • 13392 Words
    • 54 Pages
    Powerful Essays
  • Satisfactory Essays

    -There are three different operations known as Elementary Row Operations used when solving or reducing a matrix, using Gauss-Jordan elimination method. 1. Interchanging two rows. 2. Add one row to another row, or multiply one row first and then adding it to another. 3. Multiplying a row by any constant greater than zero.…

    • 817 Words
    • 4 Pages
    Satisfactory Essays
  • Good Essays

    Key Words

    • 1459 Words
    • 10 Pages

    A matrix with one row, such as [9 5] or [3 2 1 6], is called…

    • 1459 Words
    • 10 Pages
    Good Essays

Related Topics