The complexity of interacting automata

Olivier Gossner, Penélope Hernández, Ron Peretz

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This paper studies the interaction of automata of size m. We characterise statistical properties satisfied by random plays generated by a correlated pair of automata with m states each. We show that in some respect the pair of automata can be identified with a more complex automaton of size comparable to (Formula presented.). We investigate implications of these results on the correlated min–max value of repeated games played by automata.

Original languageEnglish
Pages (from-to)461-496
Number of pages36
JournalInternational Journal of Game Theory
Volume45
Issue number1-2
DOIs
StatePublished - 1 Mar 2016

Bibliographical note

Publisher Copyright:
© 2015, Springer-Verlag Berlin Heidelberg.

Keywords

  • Automata
  • Bounded memory
  • Complexity
  • De Bruijn sequences

Fingerprint

Dive into the research topics of 'The complexity of interacting automata'. Together they form a unique fingerprint.

Cite this