(a) Explanation Given Information: The payoff matrix for the game is given to be [ 0 12 4 10 6 4 ] . Calculation: Consider the given payoff matrix, [ 0 12 4 10 6 4 ] Adding 2 to each of the entries yields the matrix, [ 0 + 2 12 + 2 4 + 2 10 + 2 6 + 2 4 + 2 ] = [ 2 14 6 12 8 6 ] As the optimal strategy of two payoff matrices differing by a constant for each term is same. Follow the steps to find the optimal strategy for C. The associated linear programming problem is as follows: Let z 1 , z 2 be chosen so as to maximize z 1 + z 2 subject to constraints { z 1 ≥ 0 , z 2 ≥ 0 2 z 1 + 14 z 2 ≤ 1 6 z 1 + 12 z 2 ≤ 1 8 z 1 + 6 z 2 ≤ 1 Consider the system of inequalities: z 1 ≥ 0 , z 2 ≥ 0 2 z 1 + 14 z 2 ≤ 1 6 z 1 + 12 z 2 ≤ 1 8 z 1 + 6 z 2 ≤ 1 The graph of each individual system of inequalities are as follows: Consider the inequality z 1 ≥ 0 . The graph of the equation z 1 = 0 is the axes z 2 The inequality z 1 ≥ 0 means the region lying to the right of the axes z 2 Therefore, the resulting region is shown below: Consider the inequality z 2 ≥ 0 . The graph of the equation z 2 = 0 is the axes z 1 The inequality z 2 ≥ 0 means the region lying above of the axes z 1 Therefore, the resulting region is shown below: Consider the inequality, 2 z 1 + 14 z 2 ≤ 1 Take convenient points to plot the corresponding equation 2 z 1 + 14 z 2 = 1 as follows: z 1 Equation 2 z 1 + 14 z 2 = 1 z 2 = 1 − 2 z 1 14 z 2 0 z 2 = 1 − 2 ( 0 ) 14 = 1 14 1 14 1 2 z 2 = 1 − 2 ( 1 2 ) 14 = 1 − 1 14 = 0 0 1 30 z 2 = 1 − 2 ( 1 30 ) 14 = 1 − 1 15 14 = 1 15 1 15 Put test point ( 0 , 0 ) the inequality 2 z 1 + 14 z 2 ≤ 1 , 1 ≥ ? 2 ( 0 ) + 14 ( 0 ) 1 ≥ ? 0 Above statement is true. Therefore, Shade the region of the graph which contains the test point ( 0 , 0 ) . Therefore, The graph for 2 z 1 + 14 z 2 ≤ 1 is as follows: Consider the inequality, 6 z 1 + 12 z 2 ≤ 1 Take convenient points to plot the corresponding equation 6 z 1 + 12 z 2 = 1 as follows: z 1 Equation 6 z 1 + 12 z 2 = 1 z 2 = 1 − 6 z 1 12 z 2 0 z 2 = 1 − 6 ( 0 ) 12 = 1 12 1 12 1 10 z 2 = 1 − 6 ( 1 10 ) 12 = 1 − 3 5 12 = 1 30 1 30 1 30 z 2 = 1 − 6 ( 1 30 ) 12 = 1 − 1 5 12 = 1 15 1 15 Put test point ( 0 , 0 ) the inequality 6 z 1 + 12 z 2 ≤ 1 , 6 ( 0 ) + 12 ( 0 ) ≤ ? 1 0 ≤ ? 1 Above statement is true. Therefore, Shade the region of the graph which contains the test point ( 0 , 0 ) . Therefore, The graph for 6 z 1 + 12 z 2 ≤ 1 is as follows: Consider the inequality, 8 z 1 + 6 z 2 ≤ 1 Take convenient points to plot the corresponding equation 8 z 1 + 6 z 2 = 1 as follows: z 1 Equation 8 z 1 + 6 z 2 = 1 z 2 = 1 − 8 z 1 6 z 2 0 z 2 = 1 − 8 ( 0 ) 6 = 1 6 1 6 1 8 z 2 = 1 − 8 ( 1 8 ) 6 = 1 − 1 6 = 0 0 1 10 z 2 = 1 − 8 ( 1 10 ) 6 = 1 − 8 10 6 = 1 30 1 30 Put test point ( 0 , 0 ) the inequality 8 z 1 + 6 z 2 ≤ 1 , 8 ( 0 ) + 6 ( 0 ) ≤ ? 1 0 ≤ ? 1 Above statement is true (b) To determine The optimal strategy for C for the game having payoff matrix [ 6 0 4 3 8 − 1 ] .

Finite Mathematics & Its Applications (12th Edition)

12th Edition

ISBN: 9780134437767

Author: Larry J. Goldstein, David I. Schneider, Martha J. Siegel, Steven Hair

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 9.3, Problem 2CYU

(a)

To determine

To calculate: The optimal strategy for C for the game having payoff matrix [01241064] by inspection.

(b)

To determine

The optimal strategy for C for the game having payoff matrix [60438−1].

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 9.3, Problem 1CYU

Chapter 9.3, Problem 1E

Students have asked these similar questions

Consider the following normal form of a game. A B C OC OA OD OB (-3,-4) (-1,0) What is the maximin strategy of the row player? D (-2,-5) (-4,-3)

2.)A jar contains 2 red, 3 green, and 6 blue marbles. In a game a player closes their eyes, reaches into the jar and randomly chooses two marbles. The player wins the game if at least one of their marbles is red. Suppose it costs $1 to play the game and the winning prize is $3. Mathematically analyze this game and determine if it is in your financial interest to play the game.

Consider the game described by the following table. What is the best response for the column player if s/he knows that the row player will make the Y move? B OA O C ROW PLAYER O There is no definitive answer. X Y COLUMN PLAYER A 4, -1 3, -1 B -1,0 -2,4 C 2,1 0,2

Chapter 9 Solutions

Finite Mathematics & Its Applications (12th Edition)

Ch. 9.1 - Solutions can be found following the section...Ch. 9.1 - Prob. 2CYU Ch. 9.1 - Prob. 3CYU Ch. 9.1 - Prob. 1E Ch. 9.1 - Prob. 2E Ch. 9.1 - Prob. 3E Ch. 9.1 - Prob. 4E Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - Prob. 7E

Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 112, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - Prob. 12E Ch. 9.1 - Prob. 13E Ch. 9.1 - Prob. 14E Ch. 9.1 - Prob. 15E Ch. 9.1 - Prob. 16E Ch. 9.1 - Prob. 17E Ch. 9.1 - Prob. 18E Ch. 9.1 - Prob. 19E Ch. 9.1 - For each of the games that follow, give the payoff...Ch. 9.1 - Prob. 21E Ch. 9.1 - Prob. 22E Ch. 9.1 - Prob. 23E Ch. 9.2 - Solutions can be found following the section...Ch. 9.2 - Prob. 2CYU Ch. 9.2 - Prob. 1E Ch. 9.2 - Suppose that a game has payoff matrix [102120011]...Ch. 9.2 - Prob. 3E Ch. 9.2 - Prob. 4E Ch. 9.2 - Prob. 5E Ch. 9.2 - Flood Insurance A small business owner must decide...Ch. 9.2 - 7. Two players, Robert and Carol, play a game with...Ch. 9.2 - Rework Exercise 7 with [.7.3] as Roberts strategy.Ch. 9.2 - Two players, Robert and Carol, play a game with...Ch. 9.2 - 10. Rework Exercise 9 with as Robert’s...Ch. 9.2 - 11. Assume that two players, Renée and Carlos,...Ch. 9.2 - Prob. 12E Ch. 9.2 - Prob. 13E Ch. 9.2 - Prob. 14E Ch. 9.2 - Prob. 15E Ch. 9.2 - 16. Three-Finger Morra Reven and Coddy play a game...Ch. 9.3 - Prob. 1CYU Ch. 9.3 - Prob. 2CYU Ch. 9.3 - Prob. 1E Ch. 9.3 - Prob. 2E Ch. 9.3 - Prob. 3E Ch. 9.3 - Prob. 4E Ch. 9.3 - Prob. 5E Ch. 9.3 - Prob. 6E Ch. 9.3 - Prob. 7E Ch. 9.3 - In Exercises 5–12, determine the value of the game...Ch. 9.3 - In Exercises 512, determine the value of the game...Ch. 9.3 - Prob. 10E Ch. 9.3 - Prob. 11E Ch. 9.3 - Prob. 12E Ch. 9.3 - In Exercises 13–16, determine the value of the...Ch. 9.3 - Prob. 14E Ch. 9.3 - Prob. 15E Ch. 9.3 - Prob. 16E Ch. 9.3 - Prob. 17E Ch. 9.3 - Prob. 18E Ch. 9.3 - Prob. 19E Ch. 9.3 - Prob. 20E Ch. 9.3 - Prob. 21E Ch. 9.3 - Prob. 22E Ch. 9.3 - Football Suppose that, when the offense calls a...Ch. 9.3 - Prob. 24E Ch. 9.3 - Prob. 25E Ch. 9.3 - Three-Finger Mor ra Reven and Coddy play a game in...Ch. 9.3 - Advertising Strategies The Carter Company can...Ch. 9 - 1. What do the individual entries of a payoff...Ch. 9 - Prob. 2FCCE Ch. 9 - Prob. 3FCCE Ch. 9 - Prob. 4FCCE Ch. 9 - Prob. 5FCCE Ch. 9 - Prob. 6FCCE Ch. 9 - Prob. 7FCCE Ch. 9 - What is meant by the optimal mixed strategies of R...Ch. 9 - In Exercises 14, state whether or not the games...Ch. 9 - Prob. 2RE Ch. 9 - Prob. 3RE Ch. 9 - Prob. 4RE Ch. 9 - Prob. 5RE Ch. 9 - Prob. 6RE Ch. 9 - Prob. 7RE Ch. 9 - Prob. 8RE Ch. 9 - Prob. 9RE Ch. 9 - Prob. 10RE Ch. 9 - Prob. 11RE Ch. 9 - Prob. 12RE Ch. 9 - Prob. 13RE Ch. 9 - Prob. 14RE Ch. 9 - Prob. 15RE Ch. 9 - Prob. 16RE Ch. 9 - Prob. 17RE Ch. 9 - Prob. 18RE Ch. 9 - Prob. 1P Ch. 9 - Prob. 2P Ch. 9 - Prob. 3P Ch. 9 - Prob. 4P Ch. 9 - Prob. 5P Ch. 9 - Prob. 6P

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The optimal strategy for C for the game having payoff matrix [ 0 12 4 10 6 4 ] by inspection.

Solution Summary: The author explains how to calculate the optimal strategy for C for the game having payoff matrix left[cc0& 12 4& 10 6& 4end

Videos

To calculate: The optimal strategy for C for the game having payoff matrix [01241064] by inspection.

The optimal strategy for C for the game having payoff matrix [60438−1].

Want to see the full answer?

Chapter 9 Solutions