On the Complexity of Coordination

DOI10.1287/MOOR.28.1.127.14257zbMATH Open1082.91031OpenAlexW1992200953MaRDI QIDQ5704117

P. Hernández, Olivier Gossner

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4453c735cff5968b2b49ef815ded6d0a628181f3

zbMATH Keywords

complexityautomatacoordination

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Multistage and repeated games (91A20)

Related Items (9)

The complexity of interacting automata ⋮ MAXIMAL COACTIONS ⋮ Bottom-up design of strategic options as finite automata ⋮ Limits of correlation in repeated games with bounded memory ⋮ Is knowledge curse or blessing in pure coordination problems? ⋮ Playing off-line games with bounded rationality ⋮ Codification schemes and finite automata ⋮ Coordination through de Bruijn sequences ⋮ Coordination under limited depth of reasoning

This page was built for publication: On the Complexity of Coordination

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