{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T00:11:21Z","timestamp":1721175081732},"reference-count":17,"publisher":"MIT Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Life"],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>To study open-ended coevolution, we define a complexity metric over interacting finite state machines playing formal language prediction games, and study the dynamics of populations under competitive and cooperative interactions. In the past purely competitive and purely cooperative interactions have been studied extensively, but neither can successfully and continuously drive an arms race. We present quantitative results using this complexity metric and analyze the causes of varying rates of complexity growth across different types of interactions. We find that while both purely competitive and purely cooperative coevolution are able to drive complexity growth above the rate of genetic drift, mixed systems with both competitive and cooperative interactions achieve significantly higher evolved complexity.<\/jats:p>","DOI":"10.1162\/artl_a_00281","type":"journal-article","created":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T17:12:40Z","timestamp":1554138760000},"page":"74-91","source":"Crossref","is-referenced-by-count":8,"title":["Evolving Complexity in Prediction Games"],"prefix":"10.1162","volume":"25","author":[{"given":"Nick","family":"Moran","sequence":"first","affiliation":[{"name":"Brandeis University, DEMO Lab."}]},{"given":"Jordan","family":"Pollack","sequence":"additional","affiliation":[{"name":"Brandeis University DEMO Lab."}]}],"member":"281","reference":[{"key":"bib2","doi-asserted-by":"publisher","DOI":"10.1002\/cplx.10071"},{"key":"bib3","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.9.4463"},{"key":"bib4","doi-asserted-by":"publisher","DOI":"10.1109\/72.265960"},{"key":"bib6","first-page":"2172","volume-title":"Advances in Neural Information Processing Systems","author":"Chen X.","year":"2016"},{"key":"bib7","first-page":"238","volume-title":"Proceedings of the Sixth International Conference on Artificial Life","author":"Ficici S. G.","year":"1998"},{"key":"bib8","first-page":"505","volume-title":"Proceedings of the Fifth International Conference of the Society for Adaptive Behavior","author":"Ficici S. G.","year":"1998"},{"key":"bib9","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcmxrzd"},{"key":"bib11","unstructured":"Hopcroft, J. E. (1971). An n log n algorithm for minimizing states in a finite automaton, (Technical Report). Stanford, CA: Stanford University."},{"key":"bib12","first-page":"369","author":"Kolmogorov A. N.","year":"1963","journal-title":"Sankhy\u0101: The Indian Journal of Statistics, Series A"},{"key":"bib13","first-page":"295","volume-title":"Artificial life II","author":"Lindgren K.","year":"1992"},{"key":"bib14","doi-asserted-by":"publisher","DOI":"10.1162\/ARTL_a_00157"},{"key":"bib15","first-page":"1266","volume-title":"Doklady Akademii Nauk SSSR","volume":"194","author":"Maslov A.","year":"1970"},{"key":"bib16","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195124415.001.0001","volume-title":"Complexity: A guided tour","author":"Mitchell M.","year":"2009"},{"key":"bib17","doi-asserted-by":"publisher","DOI":"10.1006\/game.1994.1037"},{"key":"bib18","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(94)90286-0"},{"key":"bib19","first-page":"2226","volume-title":"Advances in Neural Information Processing Systems","author":"Salimans T.","year":"2016"},{"issue":"2","key":"bib20","first-page":"221","volume":"6","author":"Yu S.","year":"2001","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Artificial Life"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/artl_a_00281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T13:29:44Z","timestamp":1721136584000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/artl\/article\/25\/1\/74-91\/2913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1162\/artl_a_00281"],"URL":"https:\/\/doi.org\/10.1162\/artl_a_00281","relation":{},"ISSN":["1064-5462","1530-9185"],"issn-type":[{"value":"1064-5462","type":"print"},{"value":"1530-9185","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}