The Complexity of SPEs in Mean-Payoff Games

Léonard Brice,Jean-François Raskin,Marie van den Bogaard

International Colloquium on Automata, Languages and Programming (ICALP)（2022）

引用 3|浏览13

暂无评分

摘要

We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst case complexity was left open.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要