We could do that; we could try iteratively deleting dominated strategies and see if that process converged.

可以尝试迭代剔除劣势策略,然后看看会不会趋向于某种结果

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

So if we do the procedure of iteratively deleting dominated strategies, going back again, looking what's dominated, all that's left is 5 and 6.

如果我们按照这个程序,迭代剔除劣势,不断回头看看那些策略是劣势的,最终将只剩下立场5和6

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

We can look at it here; we looked at append, which added things to lists, we looked at delete, deleting things from a list.

看看这儿，append方法给数组，增加了一些内容，我们还学习了，如何删除数组中的元素。

麻省理工公开课 - 计算机科学及编程导论课程节选

This should be something familiar from when we were deleting dominated strategies.

这和我们之前学过的,迭代剔除劣势策略类似

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

And remember the voters are still there: we're just deleting the strategies.

但要记住选票还在,我们仅仅剔除了这些策略

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

And they weren't dominated even after deleting the dominated strategies.

即使在剔除劣势策略后,它们也不是劣势的

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

So in some sense we're deleting those strategies.

因此我们要剔除这两个策略

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

We learned that in this game deleting strategies that are never best response, and then deleting strategies that are never best response to anything that is a best response and so on and so forth, yielded a single strategy for each player.

我们学到了在剔除,非最佳对策的策略后,要再剔除那些在对手最佳对策下,不是最佳对策的策略,以此类推,最后每个参与人都只有一个策略了

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