{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T20:59:36Z","timestamp":1774385976068,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T00:00:00Z","timestamp":1147046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,8]]},"DOI":"10.1145\/1160633.1160736","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:04:00Z","timestamp":1161194640000},"page":"561-568","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Accident or intention"],"prefix":"10.1145","author":[{"given":"Tsz-Chiu","family":"Au","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dana","family":"Nau","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,8]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"T.-C. Au and D. Nau. An Analysis of Derived Belief Strategy's Performance in the 2005 Iterated Prisoner's Dilemma Competition. Technical Report CSTR-4756\/UMIACS-TR-2005-59 University of Maryland College Park 2005."},{"key":"e_1_3_2_1_2_1","volume-title":"The Evolution of Cooperation","author":"Axelrod R.","year":"1984","unstructured":"R. Axelrod. The Evolution of Cooperation. Basic Books, 1984."},{"key":"e_1_3_2_1_3_1","volume-title":"The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration","author":"Axelrod R.","year":"1997","unstructured":"R. Axelrod. The Complexity of Cooperation: Agent-Based Models of Competition and Collaboration. Princeton University Press, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.242.4884.1385"},{"key":"e_1_3_2_1_5_1","first-page":"566","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Barone L.","year":"2000","unstructured":"L. Barone and L. While. Adaptive learning for poker. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 566--573, 2000."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/2111282"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002791035004007"},{"key":"e_1_3_2_1_8_1","first-page":"661","volume-title":"IJCAI","author":"Billings D.","year":"2003","unstructured":"D. Billings, N. Burch, A. Davidson, R. Holte, and J. Schaeffer. Approximating game-theoretic optimal strategies for full-scale poker. In IJCAI, pages 661--668, 2003."},{"key":"e_1_3_2_1_9_1","first-page":"1467","volume-title":"Proceedings of the 2000 International Conference on Artificial Intelligence (ICAI'2000)","author":"Davidson A.","year":"2000","unstructured":"A. Davidson, D. Billings, J. Schaeffer, and D. Szafron. Improved opponent modeling in poker. In Proceedings of the 2000 International Conference on Artificial Intelligence (ICAI'2000), pages 1467--1473, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-95874-8_9","volume-title":"Paradoxical Effects of Social Behavior","author":"Donninger C.","year":"1986","unstructured":"C. Donninger. Paradoxical Effects of Social Behavior, chapter Is it always efficient to be nice?, pages 123--134. Heidelberg: Physica Verlag, 1986."},{"key":"e_1_3_2_1_11_1","volume-title":"School of Computer Science and Software Engineering","author":"Dyer D. W.","year":"2004","unstructured":"D. W. Dyer. Opponent modelling and strategy evolution in the iterated prisoner's dilemma. Master's thesis, School of Computer Science and Software Engineering, The Univ. of Western Australia, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2000-23105"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2004.1330880"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","unstructured":"G. Kendall P. Darwen and X. Yao. The iterated prisoner's dilemma competition. http:\/\/www.prisoners-dilemma.com 2005.","DOI":"10.5555\/1534355"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00134056"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01074955"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002795039003003"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002785029004004"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1177\/0022002787031004008"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00049570"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/364056a0"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/355250a0"},{"key":"e_1_3_2_1_23_1","volume-title":"IJCAI","author":"Powers R.","year":"2005","unstructured":"R. Powers and Y. Shoham. Learning against opponents with bounded memory. In IJCAI, 2005."}],"event":{"name":"AAMAS06: AAMAS '06 - 5th International Joint Conference on Autonomous Agents and Multi-agent Systems 2006","location":"Hakodate Japan","acronym":"AAMAS06","sponsor":["IFMAS The International Foundation for Multiagent Systems","SIGAI ACM Special Interest Group on Artificial Intelligence","ATAL The International Workshop on Agent Theories, Architectures, and Languages"]},"container-title":["Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1160633.1160736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1160633.1160736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:31:20Z","timestamp":1774373480000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1160633.1160736"}},"subtitle":["that is the question (in the Noisy Iterated Prisoner's Dilemma)"],"short-title":[],"issued":{"date-parts":[[2006,5,8]]},"references-count":23,"alternative-id":["10.1145\/1160633.1160736","10.1145\/1160633"],"URL":"https:\/\/doi.org\/10.1145\/1160633.1160736","relation":{},"subject":[],"published":{"date-parts":[[2006,5,8]]},"assertion":[{"value":"2006-05-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}