{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:39:16Z","timestamp":1649025556965},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T00:00:00Z","timestamp":1344643200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1007\/s10458-012-9205-x","type":"journal-article","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T10:15:44Z","timestamp":1344593744000},"page":"329-354","source":"Crossref","is-referenced-by-count":2,"title":["Forgetting as a way to avoid deception in a repeated imitation game"],"prefix":"10.1007","volume":"27","author":[{"given":"Pablo J.","family":"Villacorta","sequence":"first","affiliation":[]},{"given":"David A.","family":"Pelta","sequence":"additional","affiliation":[]},{"given":"Maria T.","family":"Lamata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,11]]},"reference":[{"key":"9205_CR1","unstructured":"Amigoni, F., Basilico, N., & Gatti, N. (2009). Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments. In Proceedings of the 26th international conference on robotics and automation (ICRA 2009) (pp. 819\u2013824). Kobe: IEEE Press."},{"key":"9205_CR2","unstructured":"Amigoni, F., Basilico, N., Gatti, N., Saporiti, A., & Troiani, S. (2010). Moving game theoretical patrolling strategies from theory to practice: An usarsim simulation. In Proceedings of the 27th international conference on robotics and automation (ICRA 2010) (pp. 426\u2013431). Barcelona: ICRA."},{"key":"9205_CR3","unstructured":"Amigoni, F., Gatti, N., & Ippedico, A. (2008). A game-theoretic approach to determining efficient patrolling strategies for mobile robots. In Proceedings of the international conference on web intelligence and intelligent agent technology (IAT 2008) (pp. 500\u2013503). Sydney: IAT."},{"key":"9205_CR4","unstructured":"Basilico, N., Gatti, N., Rossi, T., Ceppi, S., & Amigoni, F. (2009). Extending algorithms for mobile robot patrolling in the presence of adversaries to more realistic settings. In Proceedings of the international conference on web intelligence and intelligent agent technology (IAT 2009) (pp. 557\u2013564). Milan: IAT."},{"key":"9205_CR5","doi-asserted-by":"crossref","unstructured":"Conitzer, V., & Sandholm, T. (2006) Computing the optimal strategy to commit to. In Proceedings of the 7th ACM conference on electronic commerce, EC \u201906 (pp. 82\u201390). Ann Arbor: IEEE Computer Society.","DOI":"10.1145\/1134707.1134717"},{"key":"9205_CR6","unstructured":"Korzhyk, D., Conitzer, V., & Parr, R. (2011). Solving stackelberg games with uncertain observability. In Proceedings of the 10th international conference on autonomous agents and multiagent systems (AAMAS 2011) (pp. 1013\u20131020). Taipei: AAMAS."},{"key":"9205_CR7","volume-title":"Adversarial reasoning: Computational approaches to reading the opponents mind","author":"A. Kott","year":"2007","unstructured":"Kott A., McEneany W. M. (2007) Adversarial reasoning: Computational approaches to reading the opponents mind. Chapman and Hall\/CRC, Boca Raton"},{"key":"9205_CR8","unstructured":"Manasse, M. S., McGeoch, L. A., & Sleator, D. D. (1988). Competitive algorithms for on-line problems. In Proceedings ACM symposium on theory of computing (pp. 322\u2013333). Chicago: ACM."},{"key":"9205_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10458-004-6977-7","volume":"10","author":"S. Markovitch","year":"2005","unstructured":"Markovitch S., Reger R. (2005) Learning and exploiting relative weaknesses of opponent agents. Autonomous Agents and Multi-Agent Systems 10: 103\u2013130","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9205_CR10","unstructured":"McLennan, A., & Tourky, R. (2006) From imitation games to kakutani. mimeo: Yale University."},{"issue":"1","key":"9205_CR11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.geb.2009.08.003","volume":"70","author":"A. McLennan","year":"2010","unstructured":"McLennan A., Tourky R. (2010) Imitation games and computation. Games and Economic Behavior 70(1): 4\u201311","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"9205_CR12","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.geb.2009.10.003","volume":"68","author":"A. McLennan","year":"2010","unstructured":"McLennan A., Tourky R. (2010) Simple complexity from imitation games. Games and Economic Behavior 68(2): 683\u2013688","journal-title":"Games and Economic Behavior"},{"key":"9205_CR13","volume-title":"A course in game theory","author":"M. Osborne","year":"1994","unstructured":"Osborne M., Rubinstein A. (1994) A course in game theory. MIT Press, Cambridge"},{"key":"9205_CR14","unstructured":"Paruchuri, P., Pearce, J. P., & Kraus, S. (2008). Playing games for security: An efficient exact algorithm for solving bayesian stackelberg games. In Proceedings of 7th international conference on autonomous agents and multiagent systems (AAMAS 2008) (pp. 895\u2013902). Estoril: AAMAS."},{"key":"9205_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ins.2008.08.023","volume":"179","author":"D. Pelta","year":"2009","unstructured":"Pelta D., Yager R. (2009) On the conflict between inducing confusion and attaining payoff in adversarial decision making. Information Sciences 179: 33\u201340","journal-title":"Information Sciences"},{"issue":"2","key":"9205_CR16","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"Sleator D., Tarjan R. (1985) Amortized efficiency of list update and paging rules. Communications of the ACM 28(2): 202\u2013208","journal-title":"Communications of the ACM"},{"key":"9205_CR17","unstructured":"Villacorta, P., & Pelta, D. (2011). Expected payoff analysis of dynamic mixed strategies in an adversarial domain. In Proceedings of the 2011 IEEE symposium on intelligent agents (IA 2011). IEEE symposium series on computational intelligence (pp. 116 \u2013 122). Paris: SSCI."},{"issue":"1","key":"9205_CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ins.2011.09.031","volume":"186","author":"P. Villacorta","year":"2012","unstructured":"Villacorta P., Pelta D. (2012) Theoretical analysis of expected payoff in an adversarial domain. Information Sciences 186(1): 93\u2013104","journal-title":"Information Sciences"},{"key":"9205_CR19","doi-asserted-by":"crossref","unstructured":"Zuckerman, I., Kraus, S., & Rosenschein, J. S. (2012). The adversarial activity model for bounded rational agents. Journal of Autonomous Agents and Multi-Agent Systems, 24(3), 374\u2013409.","DOI":"10.1007\/s10458-010-9153-2"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-012-9205-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-012-9205-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-012-9205-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T14:38:37Z","timestamp":1562078317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-012-9205-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["9205"],"URL":"https:\/\/doi.org\/10.1007\/s10458-012-9205-x","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,11]]}}}