Question
Solve the two-person zero-sum game having the following payoff matrix for player A:
| Player B | ||||||
| B1 | B2 | B3 | B4 | B5 | ||
| Player A | A1 | 3 | 4 | 5 | –2 | 3 |
| A2 | 1 | 6 | –3 | 3 | 7 | |
Answer :
Word Count : 447
To solve the two-person zero-sum game numerically, we need to determine the optimal strategies for both players and the value of the game. This can be done using linear programming, but for simplicity, let's go step-by-step through a method known as the minimax approach. ### Step 1: Represent the payoff matrix The given payoff matrix for Player A is as follows: | | B₁ | B₂ | B₃ | B₄ | B₅ | |---------|--------|--------|--------|--------|--------| | A₁ | 3 | 4 | 5 | -2 | 3 | | A₂ _______ _____ _________ ___ ___ _______ ___ ___ ___.
______ _____ ___ _________ __________ ________ ___ __________ ________ ___ ______.
______ ________ _________ ____ _____ ________ _______ _______ _____ _____ ______.
______ _____ _____ __________ ______ _________.
____ __________ _________ __________ ______ __________ ___ ______ ____.
_________ _____ _________ _____ ________ _____ ____ ____ _____.
_____ _________ ___ _____ _____ ________ ______ ______ ____.
______ _________ ________ ___ _________ _______ ___ ______ ____.
______ _______ ______ _______ ______ ___ ___ ______.
_______ _________ _________ _______ ___ ___ ____ __________.
______ ______ _______ __________ ________ _____ _______ ________.
______ ____ ______ ______ ____.
___ ________ ________ ________ ____.
_________ ______ __________ _______ ________.
_________ _____ _____ ________ ___ ______ ________.
_______ ________ ___ _____ _____ ____.
_________ _________ __________ ______ ____ __________ ________ ________ ____.
______ ___ _______ ______ _______ __________ _______ __________ ________.
_________ _______ ______ _________ _______ ______ ________ _____ ______ _____ _________.
____ __________ _________ ______ ________ _______ ______ __________ _________ ___ ____ _________.
_______ _____ _____ ________ __________ ___ __________ _______ ______ ____ _____ ________.
________ ________ __________ ______ _________.
_________ ___ ____ ______ ______ ______ __________ ____ _____ _________.
_____ __________ ______ _________ _____ ______ ________ ____.
__________ ______ __________ _____ ___ _______ ________ ___ ____ ______ _________ ____.
_____ _____ ___ ______ ____ _________ ________.
_______ _____ ___ ______ ___ ___ _____.
__________ ___ ___ _____ ____ ____ ______ _________ ______.
__________ __________ ______ _______ __________ _________.
_______ _____ __________ _______ ___ _____ _________ __________ ______ _______ ___.
________ ________ _______ _____ ____ ___ _______ ____.
________ _________ ___ _________ _____ ___ _____.
____ ________ _______ ___ _________ __________ _______ ___ _______.
_________ ________ _________ ____ _______ ___ _________.
_______ _________ ______ __________ _________ _____.
_________ ___ ___ _______ ______ ______ ______ ___ _____ ______ _________ _____.
_____ ___ __________ ______ _____.
___ ____ ___ ______ _________ _________ ________ _____ ______ ________ _____.
________ _________ ________ __________ ____ ________ ____ ___ ______.
________ _____ ________ __________ _________ ________ _______ __________ ________ ___ ______ _____.
_________ _______ ________ ____ ______ ____ ___ ____.
_______ __________ ________ ______ ________ ______ _____ ________ _______.
____ __________.
Get Full Answer on WhatsApp
To solve the two-person zero-sum game numerically, we need to determine the optimal strategies for both players and the value of the game. This can be done using linear programming, but for simplicity, let's go step-by-step through a method known as the minimax approach. ### Step 1: Represent the payoff matrix The given payoff matrix for Player A is as follows: | | B₁ | B₂ | B₃ | B₄ | B₅ | |---------|--------|--------|--------|--------|--------| | A₁ | 3 | 4 | 5 | -2 | 3 | | A₂ _______ _____ _________ ___ ___ _______ ___ ___ ___.
______ _____ ___ _________ __________ ________ ___ __________ ________ ___ ______.
______ ________ _________ ____ _____ ________ _______ _______ _____ _____ ______.
______ _____ _____ __________ ______ _________.
____ __________ _________ __________ ______ __________ ___ ______ ____.
_________ _____ _________ _____ ________ _____ ____ ____ _____.
_____ _________ ___ _____ _____ ________ ______ ______ ____.
______ _________ ________ ___ _________ _______ ___ ______ ____.
______ _______ ______ _______ ______ ___ ___ ______.
_______ _________ _________ _______ ___ ___ ____ __________.
______ ______ _______ __________ ________ _____ _______ ________.
______ ____ ______ ______ ____.
___ ________ ________ ________ ____.
_________ ______ __________ _______ ________.
_________ _____ _____ ________ ___ ______ ________.
_______ ________ ___ _____ _____ ____.
_________ _________ __________ ______ ____ __________ ________ ________ ____.
______ ___ _______ ______ _______ __________ _______ __________ ________.
_________ _______ ______ _________ _______ ______ ________ _____ ______ _____ _________.
____ __________ _________ ______ ________ _______ ______ __________ _________ ___ ____ _________.
_______ _____ _____ ________ __________ ___ __________ _______ ______ ____ _____ ________.
________ ________ __________ ______ _________.
_________ ___ ____ ______ ______ ______ __________ ____ _____ _________.
_____ __________ ______ _________ _____ ______ ________ ____.
__________ ______ __________ _____ ___ _______ ________ ___ ____ ______ _________ ____.
_____ _____ ___ ______ ____ _________ ________.
_______ _____ ___ ______ ___ ___ _____.
__________ ___ ___ _____ ____ ____ ______ _________ ______.
__________ __________ ______ _______ __________ _________.
_______ _____ __________ _______ ___ _____ _________ __________ ______ _______ ___.
________ ________ _______ _____ ____ ___ _______ ____.
________ _________ ___ _________ _____ ___ _____.
____ ________ _______ ___ _________ __________ _______ ___ _______.
_________ ________ _________ ____ _______ ___ _________.
_______ _________ ______ __________ _________ _____.
_________ ___ ___ _______ ______ ______ ______ ___ _____ ______ _________ _____.
_____ ___ __________ ______ _____.
___ ____ ___ ______ _________ _________ ________ _____ ______ ________ _____.
________ _________ ________ __________ ____ ________ ____ ___ ______.
________ _____ ________ __________ _________ ________ _______ __________ ________ ___ ______ _____.
_________ _______ ________ ____ ______ ____ ___ ____.
_______ __________ ________ ______ ________ ______ _____ ________ _______.
____ __________.
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★★★