The communication complexity of graphical games on grid graphs

DOI10.1007/978-3-030-04612-5_8zbMath1443.91073OpenAlexW2901305081MaRDI QIDQ2190386

Chi-Jen Lu, Jen-Hou Chou

Publication date: 18 June 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-04612-5_8

zbMATH Keywords

Nash equilibriumcommunication complexity

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57) Algorithmic game theory and complexity (91A68)

Cites Work

• An information statistics approach to data stream and communication complexity
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• Communication complexity of approximate Nash equilibria
• Communication Complexity
• The Complexity of Computing a Nash Equilibrium
• Algorithms – ESA 2005
• Computing correlated equilibria in multi-player games
• Unnamed Item
• Unnamed Item

This page was built for publication: The communication complexity of graphical games on grid graphs