Table 17-20
Nadia and Maddie are two college roommates who both prefer a clean common space in their dorm room, but neither enjoys cleaning. The roommates must each make a decision to either clean or not clean the dorm room's common space. The payoff table for this situation is provided below, where the higher a player's payoff number, the better off that player is. The payoffs in each cell are shown as (payoff for Nadia, payoff for Maddie).
-Refer to Table 17-20. What is the Nash Equilibrium in this dorm room cleaning game?

Question

Table 17-20
Nadia and Maddie are two college roommates who both prefer a clean common space in their dorm room, but neither enjoys cleaning. The roommates must each make a decision to either clean or not clean the dorm room's common space. The payoff table for this situation is provided below, where the higher a player's payoff number, the better off that player is. The payoffs in each cell are shown as (payoff for Nadia, payoff for Maddie). 
-Refer to Table 17-20. What is the Nash Equilibrium in this dorm room cleaning game?

Quizplus · Accepted Answer

In a Nash Equilibrium, each player's strategy is optimal given the other player's strategy. If both Nadia and Maddie choose "Don't Clean," neither has an incentive to unilaterally change their strategy, assuming the payoff matrix supports this outcome.

Table 17-20 Nadia and Maddie Are Two College Roommates Who Both Prefer