The complexity of interacting automata

DOI10.1007/S00182-015-0521-7MaRDI QIDQ267110zbMATH OpenOpenAlexFDO

Authors Olivier Gossner, P. Hernández, Ron Peretz

Publication date 8 April 2016

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL http://eprints.lse.ac.uk/65026/1/__lse.ac.uk_storage_LIBRARY_Secondary_libfile_shared_repository_Content_Gossner%2C%20O_Complexity%20of%20interacting%20automata_Gossner_Complexity%20of%20interacting%20automata_2016.pdf

zbMATH Keywords

complexityautomatabounded memoryde Bruijn sequences

Mathematics Subject Classification ID

Multistage and repeated games (91A20)

Recommendations

• Interacting automata
• scientific article; zbMATH DE number 1886323
• Complexity of some problems from the theory of automata
• The complexity of intersecting finite automata having few final states
• The complexity of intersecting finite automata having few final states
• Complexity and universality of iterated finite automata
• scientific article; zbMATH DE number 32620
• Complexity of hierarchical networks of finite automata
• scientific article; zbMATH DE number 3874616
• Interaction Graphs

Cites work

• scientific article; zbMATH DE number 4202070 (Why is no real title available?)
• scientific article; zbMATH DE number 3777289 (Why is no real title available?)
• scientific article; zbMATH DE number 1054720 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Bernoulli shifts with the same entropy are isomorphic
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• Complexity and effective prediction
• Coordination through de Bruijn sequences
• Correlation through bounded recall strategies
• Elements of Information Theory
• Empirical Distributions of Beliefs Under Imperfect Observation
• Finite Rationality and Interpersonal Complexity in Repeated Games
• Finitely repeated games with finite automata
• Growth of strategy sets, entropy, and nonstationary bounded recall
• On the Complexity of Coordination
• Online concealed correlation and bounded rationality
• Optimal Use of Communication Resources
• Repeated games with bounded entropy
• Repeated games with finite automata
• Repeated games with stationary bounded recall strategies
• Secret Correlation in Repeated Games with Imperfect Monitoring
• Strategic entropy and complexity in repeated games
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• The strategic value of recall

Cited in

(4)

• Complexity and effective prediction
• On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
• The Complexity of Mean-Payoff Automaton Expression
• Interaction Graphs

This page was built for publication: The complexity of interacting automata

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