The communication complexity of graphical games on grid graphs

DOI10.1007/978-3-030-04612-5_8MaRDI QIDQ2190386zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

communication complexityNash equilibrium

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• Algorithms – ESA 2005
• An information statistics approach to data stream and communication complexity
• Communication Complexity
• Computing correlated equilibria in multi-player games
• How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 2243403 (Why is no real title available?)
• The complexity of computing a Nash equilibrium

Cited in

(3)

• Nash equilibria in games over graphs equipped with a communication mechanism
• Algorithms – ESA 2005
• Directed communication in games with directed graphs

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)