Explanation Given Information: The provided payoff matrix is: [ 1 − 1 1 2 2 0 ] Formula used: Formula to solve the matrix game: Step1: Reduce the matrix in the dominance form. Step2: Add a constant number k to the matrix. Step3: Now write 1 s to the right of the matrix and below the matrix and then write down the associated standard maximization problem. Step4: Now solve for the primal problem by use of the simplex method. Step5: The obtain the optical strategies and the expected value: Operation for the column Strategy: (1): Now express the dual problem as a column vector. (2): Normalize the matrix by dividing each entry of the solution vector by p (which is sum of all the entries). (3): Insert zeros in positions corresponding to the rows that where deleted in during the reduction to dominance form. Operation for the Row Strategy: (1): Now express the dual problem as a row vector. (2): Normalize the matrix by dividing each entry by p and once again be the add all the entries. (3): Insert zeros in positions corresponding to the rows that where deleted in during the reduction to dominance form. Formula for the value of the game can be calculated as e = 1 p − k . Calculation: Consider the provided payoff matrix is: [ 1 − 1 1 2 2 0 ] Add k = 1 to each entry and put 1 s to the right and be below: Represent this above problem by the matrix as: [ 2 0 3 2 3 1 1 1 1 1 1 0 ] Now, write down the dual, which is the LP problem corresponding to the new matrix as: Maximize p = x + y + z . Subject to x ≥ 0 , y ≥ 0 , z ≥ 0 , 2 x + 3 z ≤ 1 and 2 x + 3 y + z ≤ 1 . Solve the dual problem using the standard simplex method as: x y z s t p s 2 0 3 1 0 0 1 t 2 3 1 0 1 0 1 p − 1 − 1 − 1 0 0 1 0 Apply the row operation R 2 − R 1 and 2 R 3 + R 1

Finite Mathematics and Applied Calculus (MindTap Course List)

7th Edition

ISBN: 9781337274203

Author: Stefan Waner, Steven Costenoble

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 6.5, Problem 24E

To determine

To calculate: The game with the given payoff matrix and the provided payoff matrix is:

[1−112 20 ]

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 6.5, Problem 23E

Chapter 6.5, Problem 25E

Students have asked these similar questions

Solve the games with the given payoff matrix. HINT [See Example 3.] -1 1 P = 2 -1 -2 Optimal row player strategy Optimal column player strategy Expected value of the game

Investing: Inverse ETFS (Exchange Traded Funds) Inverse ETFS, sometimes referred to as "bear market" or "short" funds, are designed to deliver the opposite of the performance of the index or category they track, and so can be used by traders to bet against the stock market. The following table shows the performance of three such funds as of August 5, 2015.t Year-to-Date Loss (%) MYY (ProShares Short Midcap 400) 6 SH (ProShares Short S&P 500) 5 REW (ProShares UltraShort Technology) 7 You invested a total of $6,000 in the three funds at the beginning of 2011, including an equal amount in MYY and SH. Your total year-to-date loss amounted to $360. How much did you invest in each of the three funds? MYY $ SH REW $ %24 %24 %24

HW 9.2 You face the following decision problem: You are trying to sell your old car, which has recently been in an accident. You have two interested buyers. The first potential buyer has made an offer of $5000 for the car, if you sell the car today. The second potential buyer plans to come tomorrow when they can get here easily, and if they like the car, they would pay $7000 for it. You think there is about a 60% chance they will like the car. If for some reason you did not sell to either of these potential buyers, you would just sell it to a used car dealership for $3000. Decision: Accept First potential buyer: $5000 Or Reject First potential buyer, and then, either Second potential buyer likes car (60% chance): $7000, or Second potential buyer does not like car (40% chance): $3000 (sell to used car dealership) Part a: In terms of EMV, how much is it worth to learn whether the second buyer likes the car before you have to accept or reject the first buyer's offer? (that is, what is the…

Chapter 6 Solutions

Finite Mathematics and Applied Calculus (MindTap Course List)

Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - Prob. 3E Ch. 6.1 - Prob. 4E Ch. 6.1 - Prob. 5E Ch. 6.1 - Prob. 6E Ch. 6.1 - Prob. 7E Ch. 6.1 - In Exercises 1-26, sketch the region that...Ch. 6.1 - Prob. 9E Ch. 6.1 - Prob. 10E

Knowledge Booster

$Calculus$

Learn more about

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

The game with the given payoff matrix and the provided payoff matrix is: [ 1 − 1 1 2 2 0 ]

Solution Summary: The author calculates the matrix game using the simplex method. The solution to the primal problem is p=59 and the column player's optimal strategy is

Videos

To calculate: The game with the given payoff matrix and the provided payoff matrix is:

[1−112 20 ]

Want to see the full answer?

Chapter 6 Solutions

The game with the given payoff matrix and the provided payoff matrix is: [ 1 − 1 1 2 2 0 ]

Solution Summary: The author calculates the matrix game using the simplex method. The solution to the primal problem is p=59 and the column player's optimal strategy is

Videos

To calculate: The game with the given payoff matrix and the provided payoff matrix is: [1−112 20 ]

Want to see the full answer?

Chapter 6 Solutions

To calculate: The game with the given payoff matrix and the provided payoff matrix is:

[1−112 20 ]