{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T05:14:19Z","timestamp":1783401259113,"version":"3.54.6"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032308597","type":"print"},{"value":"9783032308603","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-30860-3_31","type":"book-chapter","created":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:19:21Z","timestamp":1783397961000},"page":"489-502","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fairness-Aware Multi-Agent Coordination for Efficient Decision Making"],"prefix":"10.1007","author":[{"given":"Yaming","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0071-0779","authenticated-orcid":false,"given":"Xinjia","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengxiang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ming Xiu","family":"Goh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6893-8650","authenticated-orcid":false,"given":"Han","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,7]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"28573","DOI":"10.1109\/ACCESS.2018.2831228","volume":"6","author":"A Dorri","year":"2018","unstructured":"Dorri, A., Kanhere, S.S., Jurdak, R.: Multi-agent systems: a survey. IEEE Access 6, 28573\u201328593 (2018)","journal-title":"IEEE Access"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Jin, W., Du, H., Zhao, B., Tian, X., Shi, B., Yang, G.: A comprehensive survey on multi-agent cooperative decision-making: scenarios, approaches, challenges and perspectives. arXiv preprint arXiv:2503.13415 (2025)","DOI":"10.2139\/ssrn.5106265"},{"key":"31_CR3","unstructured":"Yu, H., Miao, C., An, B., Leung, C., Lesser, V.R.: A reputation management model for resource constrained trustee agents. In: IJCAI, pp. 418\u2013424 (2013)"},{"key":"31_CR4","unstructured":"Arrow, K.J.: Social Choice and Individual Values, vol. 2. Wiley, New York (1964)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Meckling, W.H., Jensen, M.C.: Theory of the firm. Managerial behavior, agency costs and ownership structure. 3(4), 305\u2013360 (1976)","DOI":"10.1016\/0304-405X(76)90026-X"},{"key":"31_CR6","unstructured":"Sen, S.: Reciprocity: a foundational principle for promoting cooperative behavior among self-interested agents. In: Proceedings of the Second International Conference on Multiagent Systems, vol. 315321 (1996)"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Ezhei, M., Ladani, B.T.: Information sharing vs. privacy: a game theoretic analysis. Expert Syst. Appl. 88, 327\u2013337 (2017)","DOI":"10.1016\/j.eswa.2017.06.042"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1177\/1529100612474436","volume":"14","author":"CD Parks","year":"2013","unstructured":"Parks, C.D., Joireman, J., Van Lange, P.A.: Cooperation, trust, and antagonism: how public goods are promoted. Psychol. Sci. Public Interest 14(3), 119\u2013165 (2013)","journal-title":"Psychol. Sci. Public Interest"},{"issue":"6","key":"31_CR9","first-page":"995","volume":"64","author":"A Feldman","year":"1974","unstructured":"Feldman, A., Kirman, A.: Fairness and envy. Am. Econ. Rev. 64(6), 995\u20131005 (1974)","journal-title":"Am. Econ. Rev."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Gkatzelis, V., Psomas, A., Tan, X.: Fair and efficient online allocations with normalized valuations. In: Proceedings of the AAAI Conference on Artificial Intelligence. vol. 35, no. 6, pp. 5440\u20135447 (2021)","DOI":"10.1609\/aaai.v35i6.16685"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/s10458-015-9291-7","volume":"30","author":"A Netzer","year":"2016","unstructured":"Netzer, A., Meisels, A., Zivan, R.: Distributed envy minimization for resource allocation. Auton. Agent. Multi-Agent Syst. 30(2), 364\u2013402 (2016)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Benade, G., Kazachkov, A.M., Procaccia, A.D., Psomas, C.A.: How to make envy vanish over time. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 593\u2013610 (2018)","DOI":"10.1145\/3219166.3219179"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1613\/jair.1.13778","volume":"75","author":"P Shams","year":"2022","unstructured":"Shams, P., Beynier, A., Bouveret, S., Maudet, N.: Fair in the eyes of others. J. Artif. Intell. Res. 75, 913\u2013951 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"31_CR14","doi-asserted-by":"publisher","unstructured":"14. Driessen, T.: Cooperative games and examples. In: Cooperative Games, Solutions and Applications. TDLC, vol. 3, pp. 1\u201312. Springer, Dordrecht (1988). https:\/\/doi.org\/10.1007\/978-94-015-7787-8_1","DOI":"10.1007\/978-94-015-7787-8_1"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2004)","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair If You Can. AK Peters\/CRC Press, Natick (1998)","DOI":"10.1201\/9781439863855"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0022-0531(92)90040-O","volume":"57","author":"A Matsui","year":"1992","unstructured":"Matsui, A.: Best response dynamics and socially stable strategies. J. Econ. Theory 57(2), 343\u2013362 (1992)","journal-title":"J. Econ. Theory"},{"issue":"5","key":"31_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM (JACM) 62(5), 1\u201342 (2015)","journal-title":"J. ACM (JACM)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, M., Mauras, S., Ponitka, T.: On optimal tradeoffs between EFX and nash welfare. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 9, pp. 9688\u20139695 (2024)","DOI":"10.1609\/aaai.v38i9.28826"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Li, Z., Liu, S., Lu, X., Tao, B., Tao, Y.: A complete landscape for the price of envy-freeness. arXiv preprint arXiv:2401.01516 (2024)","DOI":"10.65109\/BXFT2671"},{"issue":"3","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum Nash welfare. ACM Trans. Econ. Comput. (TEAC) 7(3), 1\u201332 (2019)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.dam.2014.09.010","volume":"179","author":"TT Nguyen","year":"2014","unstructured":"Nguyen, T.T., Rothe, J.: Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods. Discret. Appl. Math. 179, 54\u201368 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"31_CR24","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2845926.2845929","volume":"14","author":"S Barman","year":"2015","unstructured":"Barman, S., Ligett, K.: Finding any nontrivial coarse correlated equilibrium is hard. ACM SIGecom Exchanges 14(1), 76\u201379 (2015)","journal-title":"ACM SIGecom Exchanges"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.geb.2017.04.010","volume":"104","author":"J Renault","year":"2017","unstructured":"Renault, J., Solan, E., Vieille, N.: Optimal dynamic information provision. Games Econom. Behav. 104, 329\u2013349 (2017)","journal-title":"Games Econom. Behav."},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"Neely, M.: Stochastic Network Optimization with Application to Communication and Queueing Systems. Morgan & Claypool Publishers, San Rafael (2010)","DOI":"10.1007\/978-3-031-79995-2"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Liu, S., Yu, H., Miao, C., Kot, A.C.: A fuzzy logic based reputation model against unfair ratings. In: Proceedings of the 2013 International Conference on Autonomous Agents and Multi-Agent Systems, pp. 821\u2013828 (2013)","DOI":"10.65109\/IIDJ7087"},{"key":"31_CR28","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","DOI":"10.1016\/j.cosrev.2009.04.003"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence in HCI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-30860-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:19:49Z","timestamp":1783397989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-30860-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032308597","9783032308603"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-30860-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"HCII","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human-Computer Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hcii2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2026.hci.international\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}