game tree omitted

indicating the Jerry's choice is b(hide in bedroom), d(hide in den), k(hide in kitchen)

(a)

Jerry has three choices: b, d, k.

Tom has 27 different strategies, because he has three decision nodes which have three choices respectively. The number of strategies of Tom's is 3*3*3=27.

There are three subgame perfect eq. in pure strategy:

Sj={b} St={b in b, d in d, k in k}

Sj={d} St={b in b, d in d, k in k}

Sj={k} St={b in b, d in d, k in k}

(b)

Tom has three strategies, while Jerry has 27 strategies.

St={b} Sj={d in b, b in d, b in k}

St={b} Sj={k in b, b in d, b in k}

St={d} Sj={d in b, b in d, b in k}

St={k} Sj={d in b, b in d, b in k}

There are totally 24 pure-strategy subgame perfect eq.

(c)

This is a game of imperfect information. Tom and Jerry both have three strategies, which are b, d and k.

It is apparent that there is no NE in pure strategies. And neither of them will randomize two of their strategies, because the other one will certainly deviate to a pure strategy immediately. There exists mixed-strategy eq, when both randomize all of their strategies with the same probabilities. It is indifferent for both of them between to choose a pure a strategies and to choose a mixed strategy.

谢谢大侠，太nice了。

麻烦大侠能再解释一下

There are three subgame perfect eq. in pure strategy:

Sj={b} St={b in b, d in d, k in k}

Sj={d} St={b in b, d in d, k in k}

Sj={k} St={b in b, d in d, k in k}

的含义吗？谢谢

对于一个博弈树，我们要看清每个参与人的信息集（information state）是什么，每个信息集上的行动（move）是什么，每个信息集有几个节点（node）。

如果所有参与人的所有信息集有且只有一个节点，则博弈是完全信息博弈（perfect information）。

“纯策略”是“信息集”到“行动”的映射，某参与人的一条纯策略描述了该参与人在其各信息集上将采取的行动。策略与行动是不同的概念。

在（a）中，显然博弈是完全信息的，即每个参与人的每个信息集有且只有一个节点。不过从“Tom can see where Jerry hides before searching”看，Tom应该只有三个信息集（每个信息集只有一个节点，且有三个行动）吧？这样Tom的纯策略应该是9个吧？

对于一个博弈树，我们要看清每个参与人的信息集（information state）是什么，每个信息集上的行动（move）是什么，每个信息集有几个节点（node）。

如果所有参与人的所有信息集有且只有一个节点，则博弈是完全信息博弈（perfect information）。

“纯策略”是“信息集”到“行动”的映射，某参与人的一条纯策略描述了该参与人在其各信息集上将采取的行动。策略与行动是不同的概念。

在（a）中，显然博弈是完全信息的，即每个参与人的每个信息集有且只有一个节点。不过从“Tom can see where Jerry hides before searching”看，Tom应该只有三个信息集（每个信息集只有一个节点，且有三个行动）吧？这样Tom的纯策略应该是9个吧？