We used iterative deletion in a relatively abstract setting, or not abstract, rather a play setting last time in which were choosing numbers.

我们在相对抽象的背景下探讨迭代剔除,其实也没那么抽象,比如上一讲,我们做的选数字的游戏

耶鲁公开课 - 博弈论课程节选

So if the only tool I taught you in this class was dominated strategies and the iterative deletion of dominated strategies we'd be stuck.

所以之前讲的,不要采用劣势策略,和迭代剔除劣势策略在这里就不奏效了

耶鲁公开课 - 博弈论课程节选

So have I convinced you that there's something you can do with iterative deletion?

大家都理解,有关迭代剔除的内容了吧

耶鲁公开课 - 博弈论课程节选

This process is called the "iterative deletion of dominated strategies."

这个过程被称之为,迭代剔除劣势策略

耶鲁公开课 - 博弈论课程节选

I think that's probably enough for iterative deletion.

我认为迭代剔除已经讲的差不多了

耶鲁公开课 - 博弈论课程节选

Iterative Deletion of Dominated Strategies.

迭代剔除劣势策略

耶鲁公开课 - 博弈论课程节选

So what Christine is arguing is, even though it's the case that 2 is not a dominated strategy, if we do the process of iterative deletion of dominated strategies and we delete the dominated strategies, then maybe we should look again and see if it's dominated now.

克里斯汀说的是,即使选择立场2不是劣势策略,如果我们迭代剔除劣势策略,然后我们剔除掉了劣势策略,然后再来回头看看还有没有劣势策略了

耶鲁公开课 - 博弈论课程节选