{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T14:47:49Z","timestamp":1774018069897,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Jerry S. Dobrovolny Chair"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Dyn Games Appl"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Cooperative games model strategic settings in which agents coordinate to form partnerships and share payoffs to achieve mutually beneficial outcomes. These settings range from pairwise matchings to larger groups forming coalitions. In this paper, we address two setups of cooperative games: transferable utility coalitional games and bipartite\n                    <jats:italic>B<\/jats:italic>\n                    -matchings. For both settings, we propose distributed dynamics where agents form and break partnerships according to evolving internal aspiration levels that reflect self-interest. Our distributed dynamics require simple computations, limited memory, and minimal knowledge of the environment. We prove that these dynamics converge to stable outcomes analogous to the core, where no group of agents has an incentive to deviate from the proposed partnerships. We illustrate our dynamics through computational experiments on exchange networks. The simulations exhibit resilient behavior of the algorithms under message drops between the agents and dynamic entry and exit of agents.\n                  <\/jats:p>","DOI":"10.1007\/s13235-025-00678-8","type":"journal-article","created":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T09:13:10Z","timestamp":1760087590000},"page":"340-385","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Dynamics and Stable Outcomes in Coalitional Games and B-Matchings"],"prefix":"10.1007","volume":"16","author":[{"given":"Aya","family":"Hamed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff S.","family":"Shamma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"678_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal A, Dahleh MA, Sarkar T (2019) A marketplace for data: An algorithmic solution. In: 2019 ACM conference on economics and computation (EC \u201919). New York, NY, USA, pp 701\u2013726","DOI":"10.1145\/3328526.3329589"},{"issue":"3","key":"678_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.2307\/2971721","volume":"64","author":"M Agastya","year":"1997","unstructured":"Agastya M (1997) Adaptive play in multiplayer bargaining situations. Rev Econ Stud 64(3):411\u2013426","journal-title":"Rev Econ Stud"},{"issue":"3","key":"678_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1142\/S0219198909002352","volume":"11","author":"KR Apt","year":"2009","unstructured":"Apt KR, Witzel A (2009) A generic approach to coalition formation. Int Game Theory Rev 11(3):347\u2013367","journal-title":"Int Game Theory Rev"},{"issue":"3","key":"678_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0167-2681(02)00015-X","volume":"49","author":"T Arnold","year":"2002","unstructured":"Arnold T, Schwalbe U (2002) Dynamic coalition formation and the core. J Econ Behav Organ 49(3):363\u2013380","journal-title":"J Econ Behav Organ"},{"key":"678_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s43154-022-00087-4","volume":"3","author":"H Aziz","year":"2022","unstructured":"Aziz H, Pal A, Pourmiri A, Ramezani F, Sims B (2022) Task allocation using a team of robots. Curr Robot Rep 3:227\u2013238","journal-title":"Curr Robot Rep"},{"key":"678_CR6","doi-asserted-by":"crossref","unstructured":"Bistaffa F, Farinelli A (2013) A fast approach to form core-stable coalitions based on a dynamic model. In: Ieee\/wic\/acm international joint conferences on web intelligence (wi) and intelligent agent technologies (iat). Atlanta GA USA, pp 122\u2013129","DOI":"10.1109\/WI-IAT.2013.100"},{"issue":"2","key":"678_CR7","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1086\/227866","volume":"89","author":"KS Cook","year":"1983","unstructured":"Cook KS, Emerson RM, Gillmore MR, Yamagishi T (1983) The distribution of power in exchange networks: theory and experimental results. Am J Sociol 89(2):275\u2013305","journal-title":"Am J Sociol"},{"issue":"3","key":"678_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3456756","volume":"9","author":"JP Dickerson","year":"2021","unstructured":"Dickerson JP, Sankararaman KA, Srinivasan A, Xu P (2021) Allocation problems in ride-sharing platforms: online matching with offline reusable resources. ACM Trans Econ Comput 9(3):1\u201317","journal-title":"ACM Trans Econ Comput"},{"key":"678_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0301-1","volume":"5","author":"J Dijkstra","year":"2015","unstructured":"Dijkstra J (2015) Social exchange: relations and networks. Soc Netw Anal Min 5:60","journal-title":"Soc Netw Anal Min"},{"key":"678_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.apenergy.2018.03.086","volume":"222","author":"Y Du","year":"2018","unstructured":"Du Y (2018) A cooperative game approach for coordinating multi-microgrid operation within distribution systems. Appl Energy 222:383\u2013395","journal-title":"Appl Energy"},{"key":"678_CR11","unstructured":"Gangam RR, Garg N, Shahkar P, Vazirani VV (2024) Equitable core imputations for max-flow, MST and $$b$$-matching games. In: arXiv arXiv:2403.06037"},{"key":"678_CR12","unstructured":"Gangam RR, Taherija S, Vazirani VV (2025) On the core of the $$b$$-matching game. In: arXiv. arXiv:2502.01914"},{"issue":"9","key":"678_CR13","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey BP, Matari\u0107 MJ (2004) A formal analysis and taxonomy of task allocation in multi-robot systems. Int J Robot Res 23(9):939\u2013954","journal-title":"Int J Robot Res"},{"key":"678_CR14","doi-asserted-by":"crossref","unstructured":"Hamed A, Shamma JS (2023) Distributed learning dynamics for coalitional games. In: 2023 62nd IEEE conference on decision and control (CDC). Singapore, Singapore, pp 5020\u20135025","DOI":"10.1109\/CDC49753.2023.10383864"},{"key":"678_CR15","doi-asserted-by":"crossref","unstructured":"Hamed A, Shamma JS (2024) Distributed learning dynamics converging to the core of $$B$$-matchings. In: 2024 63rd IEEE conference on decision and control (CDC). Milan, Italy, pp 3215\u20133220","DOI":"10.1109\/CDC56724.2024.10886228"},{"issue":"2","key":"678_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/JSAC.2017.2659098","volume":"35","author":"D Hamza","year":"2017","unstructured":"Hamza D, Shamma JS (2017) BLMA: a blind matching algorithm with application to cognitive radio networks. IEEE J Sel Areas Commun 35(2):302\u2013316","journal-title":"IEEE J Sel Areas Commun"},{"key":"678_CR17","doi-asserted-by":"crossref","unstructured":"Hamza D, Shamma JS (2017) Many-to-one blind matching for device-to-device communications. In: 2017 IEEE 56th annual conference on decision and control (CDC). Melbourne, VIC, Australia, pp 4988\u20134993","DOI":"10.1109\/CDC.2017.8264397"},{"key":"678_CR18","unstructured":"Jackson MO (2008) Networked markets. In: Social and economic networks. Princeton University Press, Princeton, Chap.\u00a010, pp 327\u2013368"},{"key":"678_CR19","unstructured":"Kevi E, Nguy$$\\tilde{\\hat{e}}$$n KT (2023) Primal-dual algorithms with predictions for online bounded allocation and ad-auctions problems. In: The 34th international conference on algorithmic learning theory. Singapore, pp 891\u2013908"},{"issue":"5","key":"678_CR20","doi-asserted-by":"publisher","first-page":"S593","DOI":"10.1137\/15M1026304","volume":"38","author":"A Khan","year":"2016","unstructured":"Khan A et al (2016) Efficient approximation algorithms for weighted $$b$$-matching. SIAM J Sci Comput 38(5):S593\u2013S619","journal-title":"SIAM J Sci Comput"},{"key":"678_CR21","doi-asserted-by":"crossref","unstructured":"Kleinberg J, Tardos \u00c9 (2008) Balanced outcomes in social exchange networks. In: Proceedings of the fortieth annual ACM symposium on theory of computing. STOC \u201908. Association for Computing Machinery (ACM), Victoria, British Columbia, Canada, pp 295\u2013304","DOI":"10.1145\/1374376.1376994"},{"key":"678_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/dimacs\/066\/06","volume":"66","author":"RJ La","year":"2004","unstructured":"La RJ, Anantharam V (2004) A game-theoretic look at the gaussian multiaccess channel. DIMACS Ser Discrete Math Theoret Comput Sci 66:87\u2013105","journal-title":"DIMACS Ser Discrete Math Theoret Comput Sci"},{"issue":"4","key":"678_CR23","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta A (2013) Online matching and ad allocation. Found Trends Theor Comput Sci 8(4):265\u2013368","journal-title":"Found Trends Theor Comput Sci"},{"key":"678_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.apenergy.2019.01.208","volume":"239","author":"J Mei","year":"2019","unstructured":"Mei J, Chen C, Wang J, Kirtley JL (2019) Coalitional game theory based local power exchange algorithm for networked microgrids. Appl Energy 239:133\u2013141","journal-title":"Appl Energy"},{"issue":"2","key":"678_CR25","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1111\/geer.12160","volume":"20","author":"HH Nax","year":"2019","unstructured":"Nax HH (2019) Uncoupled aspiration adaptation dynamics into the core. German Econ Rev 20(2):243\u2013256","journal-title":"German Econ Rev"},{"issue":"4","key":"678_CR26","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1007\/s00182-014-0459-1","volume":"44","author":"HH Nax","year":"2015","unstructured":"Nax HH, Pradelski BSR (2015) Evolutionary dynamics and equitable core selection in assignment games. Int J Game Theory 44(4):903\u2013932","journal-title":"Int J Game Theory"},{"issue":"1","key":"678_CR27","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/j.jet.2011.11.007","volume":"147","author":"J Newton","year":"2012","unstructured":"Newton J (2012) Recontracting and stochastic stability in cooperative games. J Econ Theory 147(1):364\u2013381","journal-title":"J Econ Theory"},{"issue":"2","key":"678_CR28","doi-asserted-by":"publisher","first-page":"31","DOI":"10.3390\/g9020031","volume":"9","author":"J Newton","year":"2018","unstructured":"Newton J (2018) Evolutionary game theory: a renaissance. Games 9(2):31","journal-title":"Games"},{"key":"678_CR29","unstructured":"Peters H (2008) Cooperative games with transferable utility. In: Game theory: a multi-leveled approach. Springer, Berlin, Heidelberg, Germany"},{"issue":"2","key":"678_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TEMPR.2023.3262581","volume":"1","author":"AA Raja","year":"2023","unstructured":"Raja AA, Grammatico S (2023) Online coalitional games for real-time payoff distribution with applications to energy markets. IEEE Trans Energy Mark Policy Regul 1(2):97\u2013106","journal-title":"IEEE Trans Energy Mark Policy Regul"},{"issue":"5","key":"678_CR31","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/MSP.2009.000000","volume":"26","author":"W Saad","year":"2009","unstructured":"Saad W, Han Z, Debbah M, Hj\u00f8rungnes A, Ba\u015far T (2009) Coalitional game theory for communication networks. IEEE Signal Process Mag 26(5):77\u201397","journal-title":"IEEE Signal Process Mag"},{"key":"678_CR32","doi-asserted-by":"publisher","first-page":"2114","DOI":"10.1109\/INFCOM.2009.5062135","volume":"2009","author":"W Saad","year":"2009","unstructured":"Saad W, Han Z, Debbah M, Hj\u00f8rungnes A, Ba\u015far T (2009) Coalitional games for distributed collaborative spectrum sensing in cognitive radio networks. IEEE INFOCOM 2009:2114\u20132122","journal-title":"IEEE INFOCOM"},{"key":"678_CR33","doi-asserted-by":"crossref","unstructured":"Saad W, Han Z, Poor HV (2011) Coalitional game theory for cooperative micro-grid distribution networks. In: 2011 IEEE international conference on communications workshops (ICC). Kyoto, Japan, pp 1\u20135","DOI":"10.1109\/iccw.2011.5963577"},{"key":"678_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2025.107299","author":"L Sanit\u00e0","year":"2025","unstructured":"Sanit\u00e0 L, Verberk L (2025) A note on the core of 2-matching games. Oper Res Lett. https:\/\/doi.org\/10.1016\/j.orl.2025.107299","journal-title":"Oper Res Lett"},{"key":"678_CR35","unstructured":"Schrijver A (2003) Part III: Nonbipartite matching and covering. In: Combinatorial optimization - polyhedra and efficiency. Springer, Berlin, Heidelberg, Germany"},{"issue":"4","key":"678_CR36","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1111\/j.0735-2751.2005.00260.x","volume":"23","author":"B Simpson","year":"2005","unstructured":"Simpson B, Willer D (2005) The structural embeddedness of collective goods: connection and coalitions in exchange networks. Sociol Theory 23(4):386\u2013407","journal-title":"Sociol Theory"},{"key":"678_CR37","unstructured":"Vazirani VV (2022) New characterizations of core imputations of matching and $$b$$-matching games. In: 2022 42nd IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2022). Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, , 28:1\u201328:13"},{"key":"678_CR38","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.trb.2019.07.009","volume":"129","author":"H Wang","year":"2019","unstructured":"Wang H, Yang H (2019) Ridesourcing systems: a framework and review. Transp Res Part B-Methodol 129:122\u2013155","journal-title":"Transp Res Part B-Methodol"}],"container-title":["Dynamic Games and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-025-00678-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13235-025-00678-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13235-025-00678-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T13:02:43Z","timestamp":1774011763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13235-025-00678-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["678"],"URL":"https:\/\/doi.org\/10.1007\/s13235-025-00678-8","relation":{},"ISSN":["2153-0785","2153-0793"],"issn-type":[{"value":"2153-0785","type":"print"},{"value":"2153-0793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"1 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}