A game has a Nash equilibrium when the two players' dominant strategies

A) depend on what the other player does.
B) intersect in a specific cell of the payoff matrix.
C) result in the largest total payoff for the two players combined.
D) result in no loss for either player.

Nash Equilibrium

A concept in game theory where no player can benefit by changing strategies while the other players keep theirs unchanged, leading to a stable state of the game.

Payoff Matrix

A table that shows the potential outcomes of different strategies in a game or decision-making situation for all involved players.

Dominant Strategies

In game theory, strategies that result in the best possible outcome for a player, regardless of the actions taken by other players.