Item$21$

$0\mathrm{.}75$points

Time Remaining $3$ hours $1$ minute $43$ seconds

$03$:$01$:$43$

eBookReferences

Item $21$

Time Remaining $3$ hours $1$ minute $43$ seconds

$03$:$01$:$43$

Identify the definition for each term from the following list.

$$

$1.$ Payoff$-$matrix format.

$$

$2.$ Game$-$tree format.

$$

$3.$A junction on a game tree.

$$

$4.$ One of the final outcomes of a game tree.

$$

$5.$ Divides the overall game tree into nested subgames before working backward from right to left.

$$

$6.$A mini$-$game within the overall game.

$$

$7.$ The process of backward induction that relies on both firms having perfect information about the decisions made in each subgame.

$$

$8.$A statement of coercion that is not believable by the threatened firm.

$$

$9.$A statement of coercion $($a threat!$)$ that is believable by the other firm.

$$

$10.$ Allows a firm to preempt major rivals, or greatly slow their entry into an industry.

$$

$11.$ Both rivals see their current strategy as optimal given the other firm$$s strategic choice.

$$

$$

$$Instructions: Enter a numeric response corresponding to its definition as listed above.

$$

a$.$ Terminal nodes: $.$

$$

b$.$ Strategic form: $.$

$$

c$.$ First$-$mover advantage: $.$

$$