On the Complexity of Coordination

DOI10.1287/MOOR.28.1.127.14257MaRDI QIDQ5704117zbMATH OpenOpenAlexFDO

Authors Olivier Gossner, P. Hernández

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

automatacomplexitycoordination

Mathematics Subject Classification ID

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

Recommendations

• Repeated games, finite automata, and complexity
• Finitely repeated games with finite automata
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• scientific article; zbMATH DE number 1054720
• Repeated games with finite automata

Cited in

(13)

• Codification schemes and finite automata
• Limits of correlation in repeated games with bounded memory
• Is knowledge curse or blessing in pure coordination problems?
• Coordination through de Bruijn sequences
• Coordination under limited depth of reasoning
• The complexity of interacting automata
• Coordination complexity: small information coordinating large populations
• MAXIMAL COACTIONS
• On learning to coordinate. Random bits help, insightful normal forms, and competency isomorphisms
• Bottom-up design of strategic options as finite automata
• The optimal way to play the most difficult repeated two-player coordination games
• The optimal way to play the most difficult repeated coordination games
• Playing off-line games with bounded rationality

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)