Game theory problem Analyze the following games( only 1c) computational techniqu
ID: 3316970 • Letter: G
Question
Game theory problemAnalyze the following games( only 1c) computational techniques problem. thank you! ine the payoff matrices for the following two-person, zero-sum games. as two cards, a red i and a black 7h has three cards, a red 3, a red and a black 9. Each selects a card, with his choice unknown to his opponent. The selected cards are then compared: if they are of the same color, Pr wins the sum in face values of the selected cards from P. otherwise, wins that amount from P (b) As in part (a),except that if the colors of the selected cards are not the same. wins an amount x from Pi (c) P selects a number n from A UB, where A = { 1,2) and B = {3,4}, and P2 attempts to guess the selected number. If P2's guess is correct, P2 wins 2n from P; and if his guess is incorrect but in the same set A or B as n, the game is a draw. If P2's guess is not in the same set as n, Pt wins n from P
Explanation / Answer
a)
Here is the pay-off matrices of all possible events:-
b)
c)
for P1 Red Black Red (1/6)*(4) + (1/6)*(9) = 13/6 (1/6)*(-10) = -10/6 Black (1/6)*(-10) + (1/6)*(-15) = -25/6 (1/6)*(16) = 16/6Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.