Peeling Away Dominated Strategies

Row chooses U, M or D and Column chooses L, C or R, simultaneously and once. Each cell below is (Row's payoff, Column's payoff). Row plays U: vs L gives (4, 0), vs C gives (0, 2), vs R gives (1, 2) Row plays M: vs L gives (3, 2), vs C gives (2, 1), vs R gives (4, 3) Row plays D: vs L gives (2, 3), vs C gives (1, 3), vs R gives (5, 4) Both players are rational and this is common knowledge, so each repeatedly deletes strategies that are strictly dominated by another remaining pure strategy. Exactly one outcome survives. What is the sum of the two players' payoffs at that outcome? Give an integer.

• combinations
• dominant strategy
• graph theory
• information
• nash equilibrium

Source: Textbook-style iterated strict dominance exercise; no single originator. Original numbers written for AxiomIQ.