The complexity of interacting automata

Olivier Gossner, Penelope Hernandez () and Ron Peretz ()
Additional contact information
Ron Peretz: Bar Ilan University

International Journal of Game Theory, 2016, vol. 45, issue 1, No 20, 496 pages

Abstract: 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 $$m\log m$$ m log m . We investigate implications of these results on the correlated min–max value of repeated games played by automata.

Keywords: Complexity; Automata; De Bruijn sequences; Bounded memory (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00182-015-0521-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:45:y:2016:i:1:d:10.1007_s00182-015-0521-7

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-015-0521-7

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().