Once you delete the dominated strategies, then you kind of go through it again and then 2 is dominated by 3.

一旦你剔除了劣势策略,再次审视这个博弈时,立场2劣势于立场3

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

So we know that 2 is not dominated, and particularly not dominated by 3, When you delete the dominated strategy of 2 dominating 1, or 1 being dominated, when you delete that and 10, then it is.

我们知道选立场2并不是劣势策略,它并不劣于选立场3,当你剔除劣于策略2的劣势策略1,或者说立场1处于劣势,当你剔除策略1和10之后,2就变成劣势策略了

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

And then you can delete it once you're sure your code is working right.

当你们能够确定你们的代码运行正常的话，你们可以把这个“printf“,语句删除掉。

哈佛公开课 - 计算机科学课程节选

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不是劣势策略,如果我们迭代剔除劣势策略,然后我们剔除掉了劣势策略,然后再来回头看看还有没有劣势策略了

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