Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria

2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)（2018）

引用 25|浏览51

暂无评分

摘要

We prove an N ^2-o(1) lower bound on the randomized communication complexity of finding an ε-approximate Nash equilibrium (for constant ε>0) in a two-player N×N game.

查看译文

关键词

Communication Complexity, Game Theory, Nash equilibrium

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要