The complexity of interacting automata
Gossner, O.
, Hernández, P. & Peretz, R.
(2016).
The complexity of interacting automata.
International Journal of Game Theory,
45(1), 461-496.
https://doi.org/10.1007/s00182-015-0521-7
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 mlogm . We investigate implications of these results on the correlated min–max value of repeated games played by automata.
| Item Type | Article |
|---|---|
| Copyright holders | © 2015 Springer-Verlag Berlin Heidelberg |
| Departments | LSE > Academic Departments > Mathematics |
| DOI | 10.1007/s00182-015-0521-7 |
| Date Deposited | 15 Jan 2016 |
| URI | https://researchonline.lse.ac.uk/id/eprint/65026 |
Explore Further
- http://www.lse.ac.uk/Mathematics/people/Olivier-Gossner.aspx (Author)
- https://www.scopus.com/pages/publications/84949507062 (Scopus publication)
- http://link.springer.com/journal/182 (Official URL)
ORCID: https://orcid.org/0000-0003-3950-0208