Exam (336).pdf - Question Find each player\u00e2\u20ac\u2122s optimal strategy and the value of the twoperson zero-sum game in Table 32 TABLE 32 246 315 Answer

Exam (336).pdf - Question Find each player’s optimal...

This preview shows page 1 - 4 out of 4 pages.

Question: Find each player’s optimal strategy and the value of the two- person zero-sum game in Table 32. TABLE 32 246 315 Answer : The table is given below. Here the method is given below for the two-person sum-game. 1. Check for a saddle point. If the game has no saddle points the go on step 2. 2. Eliminate any of the row player’s dominated strategies. Looking at the reduced matrix, eliminate any of the columns player’s dominated strategies. Now eliminate any of the row player’s dominated strategies. Continue in the same fashion until no more dominated strategies can be found. 3. If the game matrix is now , solve the game graphically.
Image of page 1
If one pure strategy is dominated by another, the player can ignore the dominated strategy without losing any advantage. Removing dominated rows and columns makes the game smaller and easier to analyze The procedure for eliminating all dominated rows and column is called the reduction by dominance and is carried out as follows.
Image of page 2
Image of page 3
Image of page 4

You've reached the end of your free preview.

Want to read all 4 pages?

  • Spring '17
  • John DOe
  • Game Theory, optimal strategy

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

Stuck? We have tutors online 24/7 who can help you get unstuck.
A+ icon
Ask Expert Tutors You can ask You can ask You can ask (will expire )
Answers in as fast as 15 minutes