{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:05:05Z","timestamp":1743141905846,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031506697"},{"type":"electronic","value":"9783031506703"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-50670-3_13","type":"book-chapter","created":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T13:02:36Z","timestamp":1703768556000},"page":"257-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Playing Repeated Coopetitive Polymatrix Games with\u00a0Small Manipulation Cost"],"prefix":"10.1007","author":[{"given":"Shivakumar","family":"Mahesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Bishop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le Cong","family":"Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Tran-Thanh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,29]]},"reference":[{"issue":"10","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1057\/palgrave.jors.2601320","volume":"53","author":"G Appa","year":"2002","unstructured":"Appa, G.: On the uniqueness of solutions to linear programs. J. Oper. Res. Soc. 53(10), 1127\u20131132 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"13_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-642-31724-8_64","volume-title":"Advances in Computational Intelligence","author":"D Baglieri","year":"2012","unstructured":"Baglieri, D., Carf\u00ec, D., Dagnino, G.B.: Asymmetric R &D alliances and coopetitive games. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012. CCIS, vol. 300, pp. 607\u2013621. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31724-8_64"},{"key":"13_CR3","unstructured":"Bansal, T., Pachocki, J., Sidor, S., Sutskever, I., Mordatch, I.: Emergent complexity via multi-agent competition. In: International Conference on Learning Representations (2018)"},{"key":"13_CR4","unstructured":"Bishop, N., Dinh, L.C., Tran-Thanh, L.: How to guide a non-cooperative learner to cooperate: Exploiting no-regret algorithms in system design. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems (2021)"},{"key":"13_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-642-31724-8_63","volume-title":"Advances in Computational Intelligence","author":"D Carf\u00ec","year":"2012","unstructured":"Carf\u00ec, D., Schilir\u00f2, D.: Global green economy and environmental sustainability: a coopetitive model. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012. CCIS, vol. 300, pp. 593\u2013606. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31724-8_63"},{"key":"13_CR6","unstructured":"Dinh, L.C., Nguyen, T.D., Zemhoho, A.B., Tran-Thanh, L., et al.: Last round convergence and no-dynamic regret in asymmetric repeated games. In: Algorithmic Learning Theory, pp. 553\u2013577. PMLR (2021)"},{"key":"13_CR7","unstructured":"Gerding, E.H., Robu, V., Stein, S., Parkes, D.C., Rogers, A., Jennings, N.R.: Online mechanism design for electric vehicle charging. In: AAMAS, pp. 811\u2013818 (2011)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Goldman, A., Tucker, A.: Theory in linear programming. In: Kuhn, H., Tucker, A. (eds.) Linear Inequalities and Related Systems, pp. 53\u201397. Princeton University Press, Princeton (1956)","DOI":"10.1515\/9781400881987-005"},{"key":"13_CR9","unstructured":"Grzeundefined, M.: Reward shaping in episodic reinforcement learning. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, pp. 565\u2013573. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2017)"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Heuer, G.A.: Uniqueness of equilibrium points in bimatrix games. Int. J. Game Theory 8(1), 13\u201325 (1979). https:\/\/doi.org\/10.1007\/BF01763049","DOI":"10.1007\/BF01763049"},{"key":"13_CR11","unstructured":"Lowe, R., et al.: Multi-agent actor-critic for mixed cooperative-competitive environments. In: Advances in Neural Information Processing Systems, vol. 30, pp. 6379\u20136390 (2017)"},{"key":"13_CR12","unstructured":"Myerson, R.B.: Game Theory: Analysis of Conflict. Harvard University Press, Cambridge (1991). http:\/\/www.jstor.org\/stable\/j.ctvjsf522"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Introduction to mechanism design (for computer scientists). In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, chap. 9, pp. 209\u2013242. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.011"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10458-005-2631-2","volume":"11","author":"L Panait","year":"2005","unstructured":"Panait, L., Luke, S.: Cooperative multi-agent learning: the state of the art. Auton. Agent. Multi-Agent Syst. 11(3), 387\u2013434 (2005)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"13_CR15","unstructured":"Parkes, D.C.: Online mechanisms. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, chap. 16, pp. 411\u2013442. Cambridge University Press, Cambridge (2007)"},{"key":"13_CR16","unstructured":"Phan, T., et al.: Learning and testing resilience in cooperative multi-agent systems. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1055\u20131063 (2020)"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Quintas, L.G.: Uniqueness of nash equilibrium points in bimatrix games. Econ. Lett. 27(2), 123\u2013127 (1988). https:\/\/doi.org\/10.1016\/0165-1765(88)90083-3. http:\/\/www.sciencedirect.com\/science\/article\/pii\/0165176588900833","DOI":"10.1016\/0165-1765(88)90083-3"},{"key":"13_CR18","unstructured":"Ryu, H., Shin, H., Park, J.: Cooperative and competitive biases for multi-agent reinforcement learning. In: Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1091\u20131099 (2021)"},{"key":"13_CR19","unstructured":"Samvelyan, M., et al.: The starcraft multi-agent challenge. In: AAMAS (2019)"},{"key":"13_CR20","first-page":"51","volume":"1","author":"L Shapley","year":"1950","unstructured":"Shapley, L., Karlin, S., Bohnenblust, H.: Solutions of discrete, two-person games. Contrib. Theory Games 1, 51\u201372 (1950)","journal-title":"Contrib. Theory Games"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Sykulski, A., Chapman, A., Munoz de Cote, E., Jennings, N.: Ea$$\\hat{\\,}$$2: the winning strategy for the inaugural lemonade stand game tournament. Front. Artif. Intell. Appl. 215 (2010). https:\/\/doi.org\/10.3233\/978-1-60750-606-5-209","DOI":"10.3233\/978-1-60750-606-5-209"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Tan, M.: Multi-agent reinforcement learning: independent vs. cooperative agents. In: Proceedings of the tenth International Conference on Machine Learning, pp. 330\u2013337 (1993)","DOI":"10.1016\/B978-1-55860-307-3.50049-6"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Wen, C., et al.: A cooperative-competitive multi-agent framework for auto-bidding in online advertising. arXiv e-prints pp. arXiv-2106 (2021)","DOI":"10.1145\/3488560.3498373"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Yuan, Q., Li, S., Wang, C., Xie, G.: Cooperative-competitive game based approach to the local path planning problem of distributed multi-agent systems. In: 2020 European Control Conference (ECC), pp. 680\u2013685. IEEE (2020)","DOI":"10.23919\/ECC51009.2020.9143792"},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/1978721.1978730","volume":"10","author":"MA Zinkevich","year":"2011","unstructured":"Zinkevich, M.A., Bowling, M., Wunder, M.: The lemonade stand game competition: solving unsolvable games. ACM SIGecom Exchanges 10(1), 35\u201338 (2011)","journal-title":"ACM SIGecom Exchanges"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50670-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T13:06:10Z","timestamp":1703768770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50670-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031506697","9783031506703"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50670-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Decision and Game Theory for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Avignon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.gamesec-conf.org\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"33","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":"19","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":"4","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":"58% - 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":"2","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)"}}]}}