Question
A two-person zero-sum game having the following payoff matrix for player A
| Player B | |||||||||||||||||||
| I | II | III | IV | V | |||||||||||||||
| I | 2 | 4 | 3 | 8 | 4 | ||||||||||||||
| Player A | II | 5 | 6 | 3 | 7 | 8 | |||||||||||||
| III | 6 | 7 | 9 | 8 | 7 | ||||||||||||||
| IV | 4 | 2 | 8 | 4 | 3 | ||||||||||||||
(i) Check whether saddle point exit or not.
(ii) If saddle point does not exit then determine optimal strategies for both the manufacturers and value of the game.
Answer :
Word Count : 558
Let's break this problem into steps: ### Step 1: Check for a saddle point A saddle point is a situation where the element of the payoff matrix is the maximum in its row and the minimum in its column, or vice versa. #### Step 1.1: Identify the row minima and column maxima - Row Minima: For each row, identify the minimum value. - Column Maxima: For each column, identify the maximum value. #### Step 1.2: Compare the row minima with the column maxima - If a row minimum is equal to a column maximum, then that element is the saddle point. #### Step 2: If a saddle point does not exist, __________ _______ ______ _____ ______ ____ ______ ______.
________ __________ _________ _________ __________ _____ _________ ___.
____ __________ _________ _________ ___.
________ __________ _____ ___ ________ ________ _________ ____ _________ __________ ______ _______.
_______ ______ _____ ________ ____.
_____ _______ ______ _____ ________ ____ _______ ________ ___.
_______ _____ _________ _______ _____ ________ _________.
______ __________ _______ _______ _____ ______ _________ ___ __________ __________ _________ ____.
_________ __________ __________ _________ _________ ___ ________ _________ ____ ________.
___ ____ ___ ______ ______ _________.
_______ _____ ___ _______ _________ _______.
___ ______ ___ ___ _____ ____ ______.
_______ ______ __________ ________ ____ _________ ___ ______ _________ _________ _________ _____.
___ _____ _____ __________ _____ _____ _______ ____ ___.
__________ ________ ___ ______ ______ ___ ____ ________ _____ ___ ___ ______.
_____ __________ _____ ____ ___ __________ ______ __________ ________ _________.
_____ ________ ___ _______ ________ __________ _____ _____ ________ ___.
_______ ______ ____ ___ _______ _____.
__________ __________ ____ __________ _______ _________ ______ _____ ________ _______.
________ ____ _______ _________ ____.
_____ _________ _________ ________ ___ _____ ___.
___ _______ _______ _______ ______ _______ _______ ____.
______ ______ ____ __________ ____ _________ _________ __________ _______.
_______ ___ __________ _____ __________ ______ ____ ___.
_______ ______ ___ ___ ________ _____ ________ ______ ______.
_________ _______ _________ ______ ________ ____.
_________ ________ ____ ___ _____ ________ _________ __________ ____ __________.
__________ _________ ________ _____ _______ __________ _______ _______ ___ ______.
_______ _____ ___ _________ __________ __________.
_________ ___ _________ ________ ____ __________ __________ ________ ____ ____ ____ __________.
___ ______ __________ __________ ____ ____ _________ _______ _____ _______ ____ _________.
______ __________ _______ ___ ____.
_______ ________ ___ _________ ____ ______ _________ ________.
_____ __________ ______ _____ ___ ____ _______ __________ __________ _____ ___.
___ _________ ____ _________ _____ ____ ______ ___.
______ _________ __________ ____ ______ _____ ________ _________ __________.
____ _________ _________ ___ ____ _________ ______ ________ _____ __________ ________ ________.
___ ______ ____ ______ ____ _______ _________ ________.
______ _____ ______ __________ ______ _______ _______ ___.
_______ _________ ___ ____ __________.
______ _______ __________ ___ ____ ___.
______ _____ __________ _____ _______ _________.
__________ _________ ____ ________ ________ _________ _____ ____ _____ _________ ___ ________.
__________ _________ _________ _____ _________ ___ _______ _________.
_____ ___ ___ _____ ___.
_____ _____ _____ ______ __________ __________ __________ ____ ______ _______ _____ _______.
_______ ________ _____ ______ _________ ________ ___ _________ _____.
_____ __________ _______ ______ ________ ________ ______ ___.
__________ ________ ____ ___ _____ _______ ________ ______ __________ ______.
_________ ______ ____ __________ _____ ________.
________ __________ _____ _____ ________.
_____ ______ _________ ________ _____ ________ ___ ___ __________ ________ _________.
______ ___ ________ ______ _____ _____ ___ _________ _____.
Get Full Answer on WhatsApp
Let's break this problem into steps: ### Step 1: Check for a saddle point A saddle point is a situation where the element of the payoff matrix is the maximum in its row and the minimum in its column, or vice versa. #### Step 1.1: Identify the row minima and column maxima - Row Minima: For each row, identify the minimum value. - Column Maxima: For each column, identify the maximum value. #### Step 1.2: Compare the row minima with the column maxima - If a row minimum is equal to a column maximum, then that element is the saddle point. #### Step 2: If a saddle point does not exist, __________ _______ ______ _____ ______ ____ ______ ______.
________ __________ _________ _________ __________ _____ _________ ___.
____ __________ _________ _________ ___.
________ __________ _____ ___ ________ ________ _________ ____ _________ __________ ______ _______.
_______ ______ _____ ________ ____.
_____ _______ ______ _____ ________ ____ _______ ________ ___.
_______ _____ _________ _______ _____ ________ _________.
______ __________ _______ _______ _____ ______ _________ ___ __________ __________ _________ ____.
_________ __________ __________ _________ _________ ___ ________ _________ ____ ________.
___ ____ ___ ______ ______ _________.
_______ _____ ___ _______ _________ _______.
___ ______ ___ ___ _____ ____ ______.
_______ ______ __________ ________ ____ _________ ___ ______ _________ _________ _________ _____.
___ _____ _____ __________ _____ _____ _______ ____ ___.
__________ ________ ___ ______ ______ ___ ____ ________ _____ ___ ___ ______.
_____ __________ _____ ____ ___ __________ ______ __________ ________ _________.
_____ ________ ___ _______ ________ __________ _____ _____ ________ ___.
_______ ______ ____ ___ _______ _____.
__________ __________ ____ __________ _______ _________ ______ _____ ________ _______.
________ ____ _______ _________ ____.
_____ _________ _________ ________ ___ _____ ___.
___ _______ _______ _______ ______ _______ _______ ____.
______ ______ ____ __________ ____ _________ _________ __________ _______.
_______ ___ __________ _____ __________ ______ ____ ___.
_______ ______ ___ ___ ________ _____ ________ ______ ______.
_________ _______ _________ ______ ________ ____.
_________ ________ ____ ___ _____ ________ _________ __________ ____ __________.
__________ _________ ________ _____ _______ __________ _______ _______ ___ ______.
_______ _____ ___ _________ __________ __________.
_________ ___ _________ ________ ____ __________ __________ ________ ____ ____ ____ __________.
___ ______ __________ __________ ____ ____ _________ _______ _____ _______ ____ _________.
______ __________ _______ ___ ____.
_______ ________ ___ _________ ____ ______ _________ ________.
_____ __________ ______ _____ ___ ____ _______ __________ __________ _____ ___.
___ _________ ____ _________ _____ ____ ______ ___.
______ _________ __________ ____ ______ _____ ________ _________ __________.
____ _________ _________ ___ ____ _________ ______ ________ _____ __________ ________ ________.
___ ______ ____ ______ ____ _______ _________ ________.
______ _____ ______ __________ ______ _______ _______ ___.
_______ _________ ___ ____ __________.
______ _______ __________ ___ ____ ___.
______ _____ __________ _____ _______ _________.
__________ _________ ____ ________ ________ _________ _____ ____ _____ _________ ___ ________.
__________ _________ _________ _____ _________ ___ _______ _________.
_____ ___ ___ _____ ___.
_____ _____ _____ ______ __________ __________ __________ ____ ______ _______ _____ _______.
_______ ________ _____ ______ _________ ________ ___ _________ _____.
_____ __________ _______ ______ ________ ________ ______ ___.
__________ ________ ____ ___ _____ _______ ________ ______ __________ ______.
_________ ______ ____ __________ _____ ________.
________ __________ _____ _____ ________.
_____ ______ _________ ________ _____ ________ ___ ___ __________ ________ _________.
______ ___ ________ ______ _____ _____ ___ _________ _____.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★