Abstract
Query complexity and communication complexity of equilibria have been actively studied in the past decade. Recent progress in these fields of informational complexity has led to a quite good understanding of equilibria. This survey summarizes the established results for the three most common solution concepts: Nash equilibria, correlated equilibria, and coarse correlated equilibria. The survey provides a high-level idea of the techniques that are utilized to deduce recently developed lower bounds on Nash equilibria.
Publisher
Association for Computing Machinery (ACM)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献