#payoff-matrix

1 question from Multi-Agent Systems

Timed test

1 question · 1 min · score and explanations at the end

Q 1 / 1Score 0 / 0

Shuffle questions

Question 1: Single choice

mediumAI-checkedMulti-Agent Systems

Two players move at the same time. Row picks T, M or B; Column picks L, C or R. Each cell lists (Row's payoff, Column's payoff).

	L	C	R
T	3, 3	0, 4	1, 1
M	4, 0	2, 2	0, 1
B	1, 1	1, 0	2, 3

Which cells are pure-strategy Nash equilibria?

(M, C) and (B, R)1
None, because neither player has a dominant strategy2
Only (T, L), the cell with the highest total payoff3
Only (M, C), since a game has exactly one equilibrium4

Keys: 1–9 select · Enter check / next