{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:06:54Z","timestamp":1743091614404,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031264115"},{"type":"electronic","value":"9783031264122"}],"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-26412-2_11","type":"book-chapter","created":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T10:03:54Z","timestamp":1678961034000},"page":"167-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heterogeneity Breaks the\u00a0Game: Evaluating Cooperation-Competition with\u00a0Multisets of\u00a0Agents"],"prefix":"10.1007","author":[{"given":"Yue","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Roth, A.E.: The Shapley value: essays in honor of Lloyd S. Shapley. Cambridge University Press (1988)","DOI":"10.1017\/CBO9780511528446"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Li, S., Wu, Y., Cui, X., Dong, H., Fang, F., Russell, S.: Robust multi-agent reinforcement learning via minimax deep deterministic policy gradient. AAAI 33, 4213\u20134220 (2019)","DOI":"10.1609\/aaai.v33i01.33014213"},{"key":"11_CR3","unstructured":"Lowe, R., Wu, Y., Tamar, A., Harb, J., Abbeel, P., Mordatch, I.: Multi-agent actor-critic for mixed cooperative-competitive environments. arXiv preprint arXiv:1706.02275 (2017)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Mordatch, I., Abbeel, P.: Emergence of grounded compositional language in multi-agent populations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11492"},{"key":"11_CR5","unstructured":"Sessa, P.G., Bogunovic, I., Kamgarpour, M., Krause, A.: No-regret learning in unknown games with correlated payoffs. In: NeurIPS (2019)"},{"key":"11_CR6","unstructured":"Aas, K., Jullum, M., L\u00f8land, A.: Explaining individual predictions when features are dependent: more accurate approximations to Shapley values. arXiv preprint arXiv:1903.10464 (2019)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Nash, J.J.F.: Equilibrium points in n-person games. Proceed. Nation. Acad. Sci. 36(1), 48\u201349 (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Aleksandrov, M., Walsh, T.: Pure nash equilibria in online fair division. In: IJCAI, pp. 42\u201348 (2017)","DOI":"10.24963\/ijcai.2017\/7"},{"key":"11_CR9","unstructured":"Balduzzi, D., Tuyls, K., Perolat, J., et al.: Re-evaluating evaluation. In: Advances in Neural Information Processing Systems 31 (2018)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-45619-9","volume":"9","author":"S Omidshafiei","year":"2019","unstructured":"Omidshafiei, S., Papadimitriou, C., Piliouras, G., et al.: $$\\alpha $$-rank: multi-agent evaluation by evolution. Sci. Rep. 9(1), 1\u201329 (2019)","journal-title":"Sci. Rep."},{"key":"11_CR11","unstructured":"Elo, A.E.: The rating of chess players, past and present. Acta Paediatrica 32(3\u20134), 201\u2013217 (1978)"},{"key":"11_CR12","unstructured":"Glickman, M.E., Jones, A.C.: Rating the chess rating system. Chance-Berlin then New york 12, 21\u201328 (1999)"},{"key":"11_CR13","unstructured":"Minka, T., Cleven, R., Zaykov, Y.: Trueskill 2: an improved Bayesian skill rating system. Technical Report (2018)"},{"key":"11_CR14","unstructured":"Harkness, K.: Official chess hand- book. D. McKay Company (1967)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-018-1234-6","volume":"58","author":"C Kiourt","year":"2019","unstructured":"Kiourt, C., Kalles, D., Pavlidis, G.: Rating the skill of synthetic agents in competitive multi-agent environments. Knowl. Inf. Syst. 58(1), 35\u201358 (2019)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10115-018-1234-6","volume":"58","author":"C Kiourt","year":"2019","unstructured":"Kiourt, C., Kalles, D., Pavlidis, G.: Rating the skill of synthetic agents in competitive multi-agent environments. Knowl. Inf. Syst. 58(1), 35\u201358 (2019)","journal-title":"Knowl. Inf. Syst."},{"issue":"14","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1016\/j.artint.2008.05.003","volume":"172","author":"SS Fatima","year":"2008","unstructured":"Fatima, S.S., Wooldridge, M., Jennings, N.R.: A linear approximation method for the Shapley value. Artif. Intell. 172(14), 1673\u20131699 (2008)","journal-title":"Artif. Intell."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Kotthoff, L., Fr\u00e9chette, A., Michalak, T.P., et al.: Quantifying algorithmic improvements over time. In: IJCAI, pp. 5165\u20135171 (2018)","DOI":"10.24963\/ijcai.2018\/716"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Li, J., Kuang, K., Wang, B., et al.: Shapley counterfactual credits for multi-agent reinforcement learning. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 934\u2013942 (2021)","DOI":"10.1145\/3447548.3467420"},{"key":"11_CR20","unstructured":"Yu, C., Velu, A., Vinitsky, E., et al.: The surprising effectiveness of PPO in cooperative, multi-agent games. arXiv preprint arXiv:2103.01955 (2021)"},{"key":"11_CR21","unstructured":"Omidshafiei, S., Pazis, J., Amato, C., et al.: Deep decentralized multi-task multi-agent reinforcement learning under partial observability. In: International Conference on Machine Learning, pp. 2681\u20132690. PMLR (2017)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Bowyer, C., Greene, D., Ward, T., et al.: Reinforcement learning for mixed cooperative\/competitive dynamic spectrum access. In: 2019 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/DySPAN.2019.8935725"},{"key":"11_CR23","unstructured":"Iqbal, S., Sha, F.: Actor-attention-critic for multi-agent reinforcement learning. In: International Conference on Machine Learning, pp. 2961\u20132970. PMLR (2019)"},{"issue":"2","key":"11_CR24","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10846-019-01106-x","volume":"99","author":"J Ma","year":"2020","unstructured":"Ma, J., Lu, H., Xiao, J., et al.: Multi-robot target encirclement control with collision avoidance via deep reinforcement learning. J. Intell. Robotic Syst. 99(2), 371\u2013386 (2020)","journal-title":"J. Intell. Robotic Syst."},{"key":"11_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105094","volume":"125","author":"S Touati","year":"2021","unstructured":"Touati, S., Radjef, M.S., Lakhdar, S.: A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games. Comput. Oper. Res. 125, 105094 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"11_CR26","first-page":"31","volume":"63","author":"K Ando","year":"2020","unstructured":"Ando, K., Takase, K.: Monte Carlo algorithm for calculating the Shapley values of minimum cost spanning tree games. J. Oper. Res. Soc. Japan 63(1), 31\u201340 (2020)","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"5","key":"11_CR27","doi-asserted-by":"publisher","first-page":"1726","DOI":"10.1016\/j.cor.2008.04.004","volume":"36","author":"J Castro","year":"2009","unstructured":"Castro, J., G\u00f3mez, D., Tejada, J.: Polynomial calculation of the Shapley value based on sampling. Comput. Oper. Res. 36(5), 1726\u20131730 (2009)","journal-title":"Comput. Oper. Res."},{"key":"11_CR28","unstructured":"Maleki, S.: Addressing the computational issues of the Shapley value with applications in the smart grid. University of Southampton (2015)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Burgess, M.A., Chapman, A.C.: Approximating the shapley value using stratified empirical Bernstein sampling. In: International Joint Conferences on Artificial Intelligence Organization (2021)","DOI":"10.24963\/ijcai.2021\/11"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/23249935.2020.1799112","volume":"17","author":"G Gnecco","year":"2021","unstructured":"Gnecco, G., Hadas, Y., Sanguineti, M.: Public transport transfers assessment via transferable utility games and Shapley value approximation. Transport. A Trans. Sci. 17(4), 540\u2013565 (2021)","journal-title":"Transport. A Trans. Sci."},{"key":"11_CR31","unstructured":"Ill\u00e9s, F., Ker\u00e9nyi, P.: Estimation of the Shapley value by ergodic sampling. arXiv preprint arXiv:1906.05224 (2019)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26412-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,16]],"date-time":"2023-03-16T10:07:02Z","timestamp":1678961222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26412-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264115","9783031264122"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26412-2_11","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":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"0","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":"22% - 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-4","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":"3-4","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)"}},{"value":"17 demo track papers have been accepted from 28 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}