{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:35:47Z","timestamp":1775255747617,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030030971","type":"print"},{"value":"9783030030988","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03098-8_15","type":"book-chapter","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T08:27:33Z","timestamp":1540283253000},"page":"242-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Repeated Triangular Trade: Sustaining Circular Cooperation with Observation Errors"],"prefix":"10.1007","author":[{"given":"Kota","family":"Shigedomi","sequence":"first","affiliation":[]},{"given":"Tadashi","family":"Sekiguchi","sequence":"additional","affiliation":[]},{"given":"Atsushi","family":"Iwasaki","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,24]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Andersen, G., Conitzer, V.: Fast equilibrium computation for infinitely repeated games. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013, pp. 53\u201359 (2013)","DOI":"10.1609\/aaai.v27i1.8573"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1017\/CBO9780511800481.006","volume-title":"Algorithmic Game Theory","author":"A Blum","year":"2007","unstructured":"Blum, A., Mansour, Y.: Learning, regret minimization, and equilibria. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 79\u2013101. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2009.04.016","volume":"70","author":"C Borgs","year":"2010","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. Games Econ. Behav. 70(1), 34\u201343 (2010)","journal-title":"Games Econ. Behav."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S026988891300009X","volume":"29","author":"A Burkov","year":"2013","unstructured":"Burkov, A., Chaib-draa, B.: Repeated games for multiagent systems: a survey. Knowl. Eng. Rev. 29, 1\u201330 (2013)","journal-title":"Knowl. Eng. Rev."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chen, L., Lin, F., Tang, P., Wang, K., Wang, R., Wang, S.: K-memory strategies in repeated games. In: Proceedings of the 16th Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017, pp. 1493\u20131498 (2017)","DOI":"10.65109\/TSYW2515"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10994-006-0143-1","volume":"67","author":"V Conitzer","year":"2007","unstructured":"Conitzer, V., Sandholm, T.: AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents. Mach. Learn. 67(1), 23\u201343 (2007)","journal-title":"Mach. Learn."},{"key":"15_CR7","unstructured":"Doshi, P., Gmytrasiewicz, P.J.: On the difficulty of achieving equilibrium in interactive POMDPs. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, pp. 1131\u20131136 (2006)"},{"issue":"2","key":"15_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1111\/j.1468-0262.2005.00583.x","volume":"73","author":"JC Ely","year":"2005","unstructured":"Ely, J.C., H\u00f6rner, J., Olszewski, W.: Belief-free equilibria in repeated games. Econometrica 73(2), 377\u2013415 (2005)","journal-title":"Econometrica"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/jeth.2000.2774","volume":"102","author":"JC Ely","year":"2002","unstructured":"Ely, J.C., V\u00e4lim\u00e4ki, J.: A robust folk theorem for the Prisoner\u2019s dilemma. J. Econ. Theory 102(1), 84\u2013105 (2002)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1257\/jep.10.3.103","volume":"10","author":"J Farrell","year":"1996","unstructured":"Farrell, J., Rabin, M.: Cheap talk. J. Econ. Perspect. 10(3), 103\u2013118 (1996)","journal-title":"J. Econ. Perspect."},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"997","DOI":"10.2307\/2951505","volume":"62","author":"D Fudenberg","year":"1994","unstructured":"Fudenberg, D., Levine, D., Maskin, E.: The folk theorem with imperfect public information. Econometrica 62(5), 997\u20131039 (1994)","journal-title":"Econometrica"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.2307\/1911307","volume":"54","author":"D Fudenberg","year":"1986","unstructured":"Fudenberg, D., Maskin, E.: The folk theorem in repeated games with discounting or with incomplete information. Econometrica 54(3), 533\u2013554 (1986)","journal-title":"Econometrica"},{"key":"15_CR13","volume-title":"Game Theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)"},{"key":"15_CR14","unstructured":"Hansen, E.A., Bernstein, D.S., Zilberstein, S.: Dynamic programming for partially observable stochastic games. In: Proceedings of the 19th National Conference on Artificial Intelligence, AAAI 2004, pp. 709\u2013715 (2004)"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"863","DOI":"10.2307\/1912767","volume":"50","author":"DM Kreps","year":"1982","unstructured":"Kreps, D.M., Wilson, R.: Sequential equilibria. Econometrica 50(4), 863\u2013894 (1982)","journal-title":"Econometrica"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.dss.2004.08.007","volume":"39","author":"ML Littman","year":"2005","unstructured":"Littman, M.L., Stone, P.: A polynomial-time Nash equilibrium algorithm for repeated games. Decis. Support Syst. 39(1), 55\u201366 (2005)","journal-title":"Decis. Support Syst."},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1257\/aer.89.1.190","volume":"89","author":"G Maggi","year":"1999","unstructured":"Maggi, G.: The role of multilateral institutions in international trade cooperation. Am. Econ. Rev. 89(1), 190\u2013214 (1999)","journal-title":"Am. Econ. Rev."},{"key":"15_CR18","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780195300796.001.0001","volume-title":"Repeated Games and Reputations","author":"GJ Mailath","year":"2006","unstructured":"Mailath, G.J., Samuelson, L.: Repeated Games and Reputations. Oxford University Press, Oxford (2006)"},{"key":"15_CR19","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvjghw98","volume-title":"Evolutionary Dynamics","author":"MA Nowak","year":"2006","unstructured":"Nowak, M.A.: Evolutionary Dynamics. Harvard University Press, Cambridge (2006)"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/364056a0","volume":"364","author":"MA Nowak","year":"1993","unstructured":"Nowak, M.A., Sigmund, K.: A strategy of win-stay, lose-shift that outperforms tit-for-tat in Prisoner\u2019s dilemma. Nature 364, 56\u201358 (1993)","journal-title":"Nature"},{"issue":"6685","key":"15_CR21","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1038\/31225","volume":"393","author":"MA Nowak","year":"1998","unstructured":"Nowak, M.A., Sigmund, K.: Evolution of indirect reciprocity by image scoring. Nature 393(6685), 573\u2013577 (1998)","journal-title":"Nature"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/jeth.2001.2819","volume":"102","author":"M Piccione","year":"2002","unstructured":"Piccione, M.: The repeated Prisoner\u2019s dilemma with imperfect private monitoring. J. Econ. Theory 102(1), 70\u201383 (2002)","journal-title":"J. Econ. Theory"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Shigenaka, F., Sekiguchi, T., Iwasaki, A., Yokoo, M.: Achieving sustainable cooperation in generalized Prisoner\u2019s dilemma with observation errors. In: Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI 2017, pp. 677\u2013683 (2017)","DOI":"10.1609\/aaai.v31i1.10577"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Shoham, Y., Leyton-Brown, K.: Learning and teaching. In: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations, pp. 189\u2013222. Cambridge University Press (2008)","DOI":"10.1017\/CBO9780511811654.008"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Tennenholtz, M., Zohar, A.: Learning equilibria in repeated congestion games. In: Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent System, AAMAS 2009, pp. 233\u2013240 (2009)","DOI":"10.65109\/EKFR7581"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2018: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03098-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:15:25Z","timestamp":1775250925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03098-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030030971","9783030030988"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03098-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.prima-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}