斯坦福大学英属哥伦比亚大学博弈论课程week3 problem set 3及其答案

最新推荐文章于 2024-06-29 20:20:08 发布

原创

最新推荐文章于 2024-06-29 20:20:08 发布 · 3k 阅读

4 ·

CC 4.0 BY-SA版权

文章标签：

#斯坦福大学英属哥伦比亚大学博弈论课程

本文详细解答了斯坦福大学和英属哥伦比亚大学博弈论课程中Week3的Problem Set 3，包含5个问题的解析，涉及概率策略和玩家行为分析。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question 1

Iterated removal of strictly dominated strategies

Normal
1 \ 2	L	M	R
U	3,8	2,0	1,2
D	0,0	1,7	8,2

We say that a game is dominance solvable, if iterative deletion of strictly dominated strategies yields a unique outcome.

True or false: The previous game is dominance solvable.
[Consider both pure strategies and mixed strategies.]

Your Answer		Score
a) True;	Correct	1.00
b) False.
Total		1.00 / 1.00

Question 2

Iterated removal of weakly dominated strategies

In order to illustrate the problem that arises when iteratively eliminating weakly dominated strategies, consider the following game:

Normal
1 \ 2	L	M	R
U	4,3	3,5	3,5
D	3,4	5,3	3,4

True or false: in the above game the order of elimination of weakly dominated strategies does not matter (that is, the final outcome is the same regardless of the order in which weakly dominated strategies are eliminated.). [Hint: start the process of iterative elimination of weakly dominated strategies by eliminating different strategies at the beginning of the process.]