A) A strategy that guarantees a win for one player. B) A situation where players cooperate to maximize total payoffs. C) A situation where all players receive the same payoff. D) A situation where no player can benefit by unilaterally changing their strategy.
A) Zero. B) Positive. C) Negative. D) Variable.
A) A strategy that always results in a loss. B) A situation where players must share resources. C) A strategy that yields a higher payoff regardless of what others do. D) A strategy that is optimal only when others choose the same.
A) Probability Theory. B) Utility Theory. C) Decision Theory. D) Game Theory.
A) The action that yields the highest payoff given the other players' strategies. B) The action that increases game length. C) The action that minimizes risk. D) The action that is chosen most frequently.
A) All players receive equal payoffs. B) A player can always improve their payoff by changing their strategy. C) It is always the Nash Equilibrium. D) No player can be made better off without making another player worse off.
A) The amount of money invested by players. B) The outcomes for each player for every combination of strategies. C) The total score accumulated by players over time. D) The sequence of moves in a game.
A) Players make decisions one after another. B) All players have the same amount of information. C) All players move simultaneously. D) Players must use mixed strategies.
A) Games where strategies and payoffs are the same regardless of players' identities. B) Games with unequal numbers of players. C) Games that require asymmetric strategies. D) Games that cannot be represented in matrix form.
A) It is Nash Equilibrium at every subgame of the original game. B) It's a strategy that guarantees the best payoff overall. C) It's only relevant in simultaneous games. D) It is the same as a dominant strategy.
A) When there is no dominant strategy. B) When players have perfect information. C) When players want to increase their payoffs deterministically. D) When only one player can win.
A) A technique to evaluate multiple Nash Equilibria. B) An approach to playing simultaneously. C) A method of solving games by analyzing from the end of the game backwards. D) A strategy to randomly select moves. |