Question: Shown below is the solution to the linear program for finding Player a's optimal mixed strategy in a two-person, zero-sum game where Player A picks

Shown below is the solution to the linear program
Shown below is the solution to the linear program for finding Player a's optimal mixed strategy in a two-person, zero-sum game where Player A picks between the strategies 2,, 2,, and a,, and Player B picks between the strategies B,, band b,, Constraints 1 through 3 correspond to strategies b,, b, and bs respectively. Constraint 4 is the constraint on the sum of PA1, PA2, and PA3. Objective Function Value = 2.800 Variable | Value | Reduced Costs PAL 0.070 0.000 PAD 0.650 0.000 PAB 0.280 0.000 GAINA 2.800 0.000 Constraint | Slack/Surplus | Dual Values 1 0.000 -0.600 2 0.000 0.400 3 0.000 0.000 4 0.000 2,800 (a) What is Player A's optimal mixed strategy? (If a strategy should not be picked, enter 0.) Player A should use strategy a, with probability, strategy a, with probability, and strategy a, with probability. (b) What is Player B's optimal mixed strategy? (If a strategy should not be picked, enter 0.) Player 8 should use strategy b, with probability, strategy b, with probability, and strategy 6, with probability, (c) What is Player A's expected gain? (d) What is Player B's expected loss

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!