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

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

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

And I would suggest palindrome as a great example of that. That's easy to think about recursively. It's much harder to think about iteratively. And you want to get into the habit of deciding which is the right one for you to use. And with that, we'll see you next time.

其它的问题可能用递归的方式,可以更好的解决,而直接思考可能很困难,这时你就得养成做出,正确选择的好习惯了,下周再见。

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

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

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

Well, we would just delete the... We would iteratively delete dominated strategies.

我觉得我们可以,迭代剔除劣势策略

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

Because the right way to do it is iteratively.

因为正确的作法是迭代。

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