Near-optimal communication lower bounds for approximate nash equilibria

SIAM JOURNAL ON COMPUTING（2023）

引用 0|浏览1

暂无评分

摘要

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

查看译文

关键词

communication complexity,game theory,Nash equilibrium

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要