A) A Nash equilibrium is a situation in which each player chooses their best strategy given the strategies chosen by the other players in the game.
B) A Cournot equilibrium is an example of a Nash equilibrium.
C) A Bertrand equilibrium is an example of a Nash equilibrium.
D) A Nash equilibrium maximizes the aggregate payoffs of the players of the game.
Correct Answer
verified
Multiple Choice
A) they value payoffs in future periods much less than they value payoffs in the current period.
B) Interactions between the players are frequent.
C) Cheating is difficult to detect.
D) The one-time gain from cheating is large in comparison to the eventual cost of cheating.
Correct Answer
verified
Multiple Choice
A) B1 is a dominated strategy for Player B
B) B2 is a dominated strategy for Player B
C) B3 is a dominated strategy for Player B
D) Player B has no dominated strategy.
Correct Answer
verified
Multiple Choice
A) Player A has a dominant strategy.
B) Player B has a dominant strategy.
C) both players have dominant strategies.
D) neither player has a dominant strategy.
Correct Answer
verified
Multiple Choice
A) This game is an example of a prisoner's dilemma game.
B) This game is not an example of a prisoner's dilemma game.
C) This game has no Nash equilibrium.
D) This game has multiple Nash equilibria in pure strategies.
Correct Answer
verified
Multiple Choice
A) Player A has a dominant strategy.
B) Player B has a dominant strategy.
C) Both players have dominant strategies.
D) Neither player has a dominant strategy.
Correct Answer
verified
Multiple Choice
A) Coke has a dominant strategy to not advertise.
B) Pepsi has a dominant strategy to not advertise.
C) The game has one Nash equilibrium.
D) The game has multiple equilibria.
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) a procedure for solving a sequential-move game by starting at the beginning of the game tree and finding the optimal decision for the player at each decision point.
B) a procedure for solving a sequential-move game by starting at the end of the game tree and finding the best response function at each decision point.
C) a procedure for solving a sequential-move game by starting at the end of the game tree and finding the player's motives for making the decision at each decision point.
D) a procedure for solving a sequential-move game by starting at the end of the game tree and finding the optimal decision for the player at each decision point.
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) Player A choosing A1 and Player B choosing B1.
B) Player A choosing A1 and Player B choosing B3.
C) Player A choosing A3 and Player B choosing B1.
D) Player A choosing A3 and Player B choosing B3.
Correct Answer
verified
Multiple Choice
A) If the players play the game repeatedly with each other, the players may play cooperatively.
B) If the game is played only once, the players would not be expected to cooperate.
C) If players play the game repeatedly with each other, they are more likely to cooperate if they are patient.
D) If the game is played only once, the outcome minimizes total jail time.
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) Player A choosing A1 and Player B choosing B1 is a Nash equilibrium.
B) Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.
C) Player A choosing A2 and Player B choosing B1 is a Nash equilibrium.
D) Player A choosing A2 and Player B choosing B2 is a Nash equilibrium.
Correct Answer
verified
True/False
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) if neither player has a dominant strategy, we successively eliminate each player's subordinate strategy.
B) a player chooses among two or more pure strategies according to pre-specified probabilities.
C) if one player has a dominant strategy and the other doesn't, you can't reach a Nash equilibrium.
D) if both players have a dominant strategy, these constitute their Nash equilibrium strategies.
Correct Answer
verified
True/False
Correct Answer
verified
Multiple Choice
A) Player A choosing A1 and Player B choosing B1 is a Nash equilibrium.
B) Player A choosing A2 and Player B choosing B2 is a Nash equilibrium.
C) there is no Nash equilibrium.
D) there are multiple Nash equilibria in pure strategies.
Correct Answer
verified
Multiple Choice
A) Nash games cannot have more than one equilibrium.
B) A game can be both Cournot and Nash.
C) A game can be both Bertrand and Nash.
D) Whenever both players have a dominant strategy in a Nash game, that strategy will determine the outcome.
Correct Answer
verified
Showing 21 - 40 of 69
Related Exams