.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
For each two-player game, a linear-programming algorithm finds a component of the Nash equilibria and a subset of its perfect equilibria that are simply stable: there are nearby equilibria for each nearby game that perturbs one strategy's probability or payoff more than others.
Keyword:
EQUILIBRIUM
STABILITY
ALGORITHM
LINEAR COMPLEMENTARITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。