{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:28:27Z","timestamp":1768552107806,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1023\/a:1007417214905","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"225-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":135,"title":["Co-Evolution in the Successful Learning of Backgammon Strategy"],"prefix":"10.1007","volume":"32","author":[{"given":"Jordan B.","family":"Pollack","sequence":"first","affiliation":[]},{"given":"Alan D.","family":"Blair","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"181109_CR1","unstructured":"Angeline, P.J. (1994). An alternate interpretation of the iterated prisoner's dilemma and the evolution of nonmutual cooperation. In R. Brooks, & P. Maes (Eds.), Proceedings 4th Artificial Life Conference (pp. 353\u2013358). MIT Press."},{"key":"181109_CR2","unstructured":"Angeline, P.J., & Pollack, J.B. (1994). Competitive environments evolve better solutions for complex tasks. In S. Forrest (Ed.), Genetic Algorithms: Proceedings of the Fifth International Conference."},{"key":"181109_CR3","volume-title":"The Evolution of Cooperation.","author":"R. Axelrod","year":"1984","unstructured":"Axelrod, R. (1984). The Evolution of Cooperation. New York: Basic Books."},{"key":"181109_CR4","unstructured":"Boyan, J.A. (1992). Modular neural networks for learning context-dependent game strategies. Master's thesis, Computer Speech and Language Processing, Cambridge University."},{"key":"181109_CR5","doi-asserted-by":"crossref","unstructured":"Cliff, D., & Miller, G. (1995). Tracking the red queen: Measurements of adaptive progress in co-evolutionary simulations. Third European Conference on Artificial Life (pp. 200\u2013218).","DOI":"10.1007\/3-540-59496-5_300"},{"key":"181109_CR6","unstructured":"Crites, R., & Barto, A. (1996). Improving elevator performance using reinforcement learning. In D. Touretzky, M. Mozer, & M. Hasselmo (Eds.), Advances in Neural Information Processing Systems (Vol. 8, pp. 1024\u20131030)."},{"key":"181109_CR7","first-page":"251","volume":"15","author":"S.L. Epstein","year":"1994","unstructured":"Epstein, S.L. (1994). Toward an ideal trainer. Machine Learning, 15, 251\u2013277.","journal-title":"Machine Learning"},{"key":"181109_CR8","doi-asserted-by":"crossref","unstructured":"Fogel, D.B. (1993). Using evolutionary programming to create neural networks that are capable of playing tictac-toe. International Conference on Neural Networks 1993 (pp. 875\u2013880). IEEE Press.","DOI":"10.1109\/ICNN.1993.298673"},{"key":"181109_CR9","unstructured":"Hillis, D. (1992). Co-evolving parasites improve simulated evolution as an optimization procedure. In C. Langton, C. Taylor, J.D. Farmer & S. Rasmussen (Eds.), Artificial Life II (pp. 313\u2013324). Addison-Wesley."},{"key":"181109_CR10","volume-title":"Advances in Genetic Programming II","author":"H. Juille","year":"1995","unstructured":"Juille, H., & Pollack, J. (1995). Massively parallel genetic programming. In P. Angeline, & K. Kinnear (Eds.), Advances in Genetic Programming II. Cambridge: MIT Press."},{"key":"181109_CR11","doi-asserted-by":"crossref","unstructured":"Littman, M.L. (1994). Markov games as a framework for multi-agent reinforcement learning. Machine Learning: Proceedings of the Eleventh International Conference (pp. 157\u2013163). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"181109_CR12","unstructured":"Littman, M.L. (1996). Algorithms for sequential decision making. Ph.D. dissertation, Providence: Brown University Computer Science Department."},{"key":"181109_CR13","volume-title":"Evolution and the Theory of Games","author":"S. J. Maynard","year":"1982","unstructured":"Maynard Smith, J. (1982). Evolution and the Theory of Games. Cambridge: Cambridge University Press."},{"key":"181109_CR14","unstructured":"Michie, D. (1961). Trial and error. Science Survey, part 2 (pp. 129\u2013145). Penguin."},{"key":"181109_CR15","first-page":"89","volume":"7","author":"M. Mitchell","year":"1993","unstructured":"Mitchell, M., Hraber, P.T., & Crutchfield, J.P. (1993). Revisiting the edge of chaos: Evolving cellular automata to perform computations. Complex Systems, 7, 89\u2013130.","journal-title":"Complex Systems"},{"key":"181109_CR16","unstructured":"Packard, N. (1988). Adaptation towards the edge of chaos. In J.A.S. Kelso, A.J. Mandell, & M.F. Shlesinger (Eds.), Dynamic Patterns in Complex Systems (pp. 293\u2013301). World Scientific."},{"key":"181109_CR17","doi-asserted-by":"crossref","unstructured":"Reynolds, C. (1994). Competition, coevolution, and the game of tag. Proceedings 4th Artificial Life Conference. MIT Press.","DOI":"10.7551\/mitpress\/1428.003.0010"},{"key":"181109_CR18","unstructured":"Rosin, C.D., & Belew, R.K. (1995). Methods for competitive co-evolution: Finding opponents worth beating. Proceedings of the 6th International Conference on Genetic Algorithms (pp. 373\u2013380). Morgan Kaufman."},{"key":"181109_CR19","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"D. Rumelhart","year":"1986","unstructured":"Rumelhart, D., Hinton, G., & Williams, R. (1986). Learning representations by back-propagating errors. Nature, 323, 533\u2013536.","journal-title":"Nature"},{"key":"181109_CR20","doi-asserted-by":"crossref","unstructured":"Samuel, A.L. (1959). Some studies of machine learning using the game of checkers. IBM Journal of Research and Development.","DOI":"10.1147\/rd.33.0210"},{"key":"181109_CR21","first-page":"817","volume":"6","author":"N.N. Schraudolph","year":"1994","unstructured":"Schraudolph, N.N., Dayan, P., & Sejnowski, T. J. (1994). Temporal difference learning of position evaluation in the game of go. Advances in Neural Information Processing Systems (Vol. 6, pp. 817\u2013824). Morgan Kauffman.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"181109_CR22","doi-asserted-by":"crossref","unstructured":"Sims, K. (1994). Evolving 3D morphology and behavior by competition. In R. Brooks, & P. Maes (Eds.), Proceedings 4th Artificial Life Conference. MIT Press.","DOI":"10.1162\/artl.1994.1.353"},{"key":"181109_CR23","first-page":"9","volume":"3","author":"R. Sutton","year":"1988","unstructured":"Sutton, R. (1988). Learning to predict by the methods of temporal differences. Machine Learning, 3, 9\u201344.","journal-title":"Machine Learning"},{"key":"181109_CR24","first-page":"99","volume-title":"Advances in Neural Information Processing Systems","author":"G. Tesauro","year":"1989","unstructured":"Tesauro, G. (1989). Connectionist learning of expert preferences by comparison training. In D. Touretzky (Ed.), Advances in Neural Information Processing Systems, Denver (Vol. 1, pp. 99\u2013106). San Mateo: Morgan Kaufmann."},{"key":"181109_CR25","first-page":"257","volume":"8","author":"G. Tesauro","year":"1992","unstructured":"Tesauro, G. (1992). Practical issues in temporal difference learning. Machine Learning, 8, 257\u2013277.","journal-title":"Machine Learning"},{"issue":"3","key":"181109_CR26","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"G. Tesauro","year":"1995","unstructured":"Tesauro, G. (1995). Temporal difference learning and td-gammon. Communications of the ACM, 38(3), 58\u201368.","journal-title":"Communications of the ACM"},{"key":"181109_CR27","unstructured":"Walker, S., Lister, R., & Downs, T. (1994). Temporal difference, non-determinism, and noise: A case study on the \u2018othello\u2019 board game. International Conference on Artificial Neural Networks 1994 (pp. 1428\u20131431). Sorrento, Italy."},{"key":"181109_CR28","unstructured":"Zhang, W., & Dietterich, T. (1996). High-performance job-shop scheduling with a time-delay td(lambda) network. In D. Touretzky, M. Mozer, & M. Hasselmo (Eds.), Advances in Neural Information Processing Systems (Vol. 8)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007417214905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007417214905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007417214905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:36:19Z","timestamp":1752147379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007417214905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["181109"],"URL":"https:\/\/doi.org\/10.1023\/a:1007417214905","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}