If two perfectly rational players play the following zero-sum matrix
games, what strategies will they use?
5 4 3
(a)
0 6 1
4 7]
6
2 0
(b) |2 5
(c) |1
11
3
6 4
3
7
9
5
6.
Create a 3x3 payoff matrix for a two person zero sum game (cannot be scissors, paper, rock)
PROBLEM (7) Rock-Scissors-Paper game is a two player simultaneous move game where each player chooses R, S or P. It is a fact that Rock crushes Scissors, which cuts Paper which in turn covers Rock; so R beats S, S beats P and P beats R. Winner gets 1 point, loser gets 0 (if they both choose the same strategy; both gets 0). Fill a 3x3 game box with two players’ payoffs in this game and answer the following;
(a) Is there a dominant strategy for Player 1? Any dominated strategy? Answer the same for Player 2.(b) Is there a Nash Equilibrium in this game?(c) If player 1 plays first and then player 2 chooses her action, would you like to be player 1 or 2 in this sequential version of the game? Draw the game tree and describe the backward induction solution (sequential Nash equilibria) in this game.
PLEASE ANSWER ALL THE PARTS!
Chapter 11 Solutions
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Introduction: MARKOV PROCESS And MARKOV CHAINS // Short Lecture // Linear Algebra; Author: AfterMath;https://www.youtube.com/watch?v=qK-PUTuUSpw;License: Standard Youtube License
Stochastic process and Markov Chain Model | Transition Probability Matrix (TPM); Author: Dr. Harish Garg;https://www.youtube.com/watch?v=sb4jo4P4ZLI;License: Standard YouTube License, CC-BY