The communication complexity of graphical games on grid graphs

DOI10.1007/978-3-030-04612-5_8zbMATH Open1443.91073OpenAlexW2901305081MaRDI QIDQ2190386FDOQ2190386

Authors: Jen-Hou Chou, Chi-Jen Lu 

Publication date: 18 June 2020

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

Recommendations

• Algorithms – ESA 2005
• The communication complexity of local search

zbMATH Keywords

Nash equilibriumcommunication complexity

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The complexity of computing a Nash equilibrium
• Communication Complexity
• Title not available (Why is that?)
• An information statistics approach to data stream and communication complexity
• Computing correlated equilibria in multi-player games
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• Algorithms – ESA 2005

Cited In (2)

• Directed communication in games with directed graphs
• Algorithms – ESA 2005

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190386)