{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T11:58:12Z","timestamp":1756382292131,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_24","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"375-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-agent Reinforcement Learning for\u00a0Decentralized Stable Matching"],"prefix":"10.1007","author":[{"given":"Kshitija","family":"Taywade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judy","family":"Goldsmith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brent","family":"Harrison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"24_CR1","unstructured":"Bachrach, Y., et al.: Negotiating team formation using deep reinforcement learning (2018)"},{"key":"24_CR2","unstructured":"Chalkiadakis, G., Boutilier, C.: Bayesian reinforcement learning for coalition formation under uncertainty. In: Proceeding of AAMAS 2004, pp. 1090\u20131097 (2004)"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/j.jebo.2017.10.013","volume":"145","author":"M Comola","year":"2018","unstructured":"Comola, M., Fafchamps, M.: An experimental study on decentralized networked markets. J. Econ. Behav. Organ. 145, 567\u2013591 (2018)","journal-title":"J. Econ. Behav. Organ."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2015.05.002","volume":"92","author":"E Diamantoudi","year":"2015","unstructured":"Diamantoudi, E., Miyagawa, E., Xue, L.: Decentralized matching: the role of commitment. Games Econ. Behav. 92, 1\u201317 (2015)","journal-title":"Games Econ. Behav."},{"key":"24_CR5","unstructured":"Echenique, F., Yariv, L.: An experimental study of decentralized matching (2012)"},{"issue":"3\u20134","key":"24_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00182-007-0081-6","volume":"36","author":"K Eriksson","year":"2008","unstructured":"Eriksson, K., H\u00e4ggstr\u00f6m, O.: Instability of matchings in decentralized markets with various preference structures. Int. J. Game Theor. 36(3\u20134), 409\u2013420 (2008)","journal-title":"Int. J. Game Theor."},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"issue":"1","key":"24_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0216010","volume":"16","author":"D Gusfield","year":"1987","unstructured":"Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111\u2013128 (1987)","journal-title":"SIAM J. Comput."},{"key":"24_CR9","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"issue":"1","key":"24_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00182-009-0218-x","volume":"40","author":"G Haeringer","year":"2011","unstructured":"Haeringer, G., Wooders, M.: Decentralized job matching. Int. J. Game Theor. 40(1), 1\u201328 (2011)","journal-title":"Int. J. Game Theor."},{"key":"24_CR11","unstructured":"Hoepman, J.H.: Simple distributed weighted matchings. arXiv cs\/0410047 (2004)"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(92)00179-P","volume":"48","author":"RW Irving","year":"1994","unstructured":"Irving, R.W.: Stable marriage and indifference. Discrete Appl. Math. 48(3), 261\u2013272 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/28869.28871","volume":"34","author":"RW Irving","year":"1987","unstructured":"Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the optimal stable marriage. J. ACM (JACM) 34(3), 532\u2013543 (1987)","journal-title":"J. ACM (JACM)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: International Conference on Informatics Education and Research for Knowledge-Circulating Society, pp. 131\u2013136. IEEE Computer Society (January 2008)","DOI":"10.1109\/ICKS.2008.7"},{"issue":"5","key":"24_CR15","doi-asserted-by":"publisher","first-page":"S593","DOI":"10.1137\/15M1026304","volume":"38","author":"A Khan","year":"2016","unstructured":"Khan, A., et al.: Efficient approximation algorithms for weighted b-matching. SIAM J. Sci. Comput. 38(5), S593\u2013S619 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"24_CR16","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Littman, M.L.: Markov games as a framework for multi-agent reinforcement learning. In: Machine Learning Proceedings 1994, pp. 157\u2013163. Elsevier (1994)","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"24_CR18","unstructured":"Matthews, T., Ramchurn, S.D., Chalkiadakis, G.: Competing with humans at fantasy football: Team formation in large partially-observable domains. In: Twenty-Sixth AAAI Conference on Artificial Intelligence, aaai.org (2012)"},{"key":"24_CR19","unstructured":"Niederle, M., Roth, A.E.: Making markets thick: How norms governing exploding offers affect market performance. preprint (2006)"},{"key":"24_CR20","unstructured":"Niederle, M., Yariv, L.: Matching through decentralized markets. Stanford University, Discussion Paper (2007)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Niederle, M., Yariv, L.: Decentralized matching with aligned preferences. Technical report, National Bureau of Economic Research (2009)","DOI":"10.3386\/w14840"},{"key":"24_CR22","unstructured":"Pais, J., Pint\u00e9r, A., Veszteg, R.F.: Decentralized matching markets: a laboratory experiment (2012)"},{"key":"24_CR23","unstructured":"Pais, J., Pint\u00e9r, \u00c1., Veszteg, R.F.: Decentralized matching markets with (out) frictions: a laboratory experiment. Exp. Econ. 1\u201328 (2017)"},{"key":"24_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-29966-7_21","volume-title":"Agents and Artificial Intelligence","author":"MS Pini","year":"2013","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Stability and optimality in matching problems with weighted preferences. In: Filipe, J., Fred, A. (eds.) ICAART 2011. CCIS, vol. 271, pp. 319\u2013333. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-29966-7_21"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R Preis","year":"1999","unstructured":"Preis, R.: Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 259\u2013269. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_24"},{"key":"24_CR26","unstructured":"Roth, A.E.: A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. Am. Econ. Rev. 415\u2013440 (1991)"},{"issue":"2","key":"24_CR27","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1086\/262074","volume":"105","author":"AE Roth","year":"1997","unstructured":"Roth, A.E., Xing, X.: Turnaround time and bottlenecks in market clearing: decentralized matching in the market for clinical psychologists. J. Political Econ. 105(2), 284\u2013329 (1997)","journal-title":"J. Political Econ."},{"key":"24_CR28","unstructured":"Rummery, G.A., Niranjan, M.: On-Line Q-Learning Using Connectionist Systems, vol. 37. University of Cambridge, Department of Engineering England (1994)"},{"issue":"1","key":"24_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1111\/j.1468-0262.2007.00735.x","volume":"75","author":"M Satterthwaite","year":"2007","unstructured":"Satterthwaite, M., Shneyerov, A.: Dynamic matching, two-sided incomplete information, and participation costs: existence and convergence to perfect competition. Econometrica 75(1), 155\u2013200 (2007)","journal-title":"Econometrica"},{"key":"24_CR30","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"issue":"2","key":"24_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s001820400196","volume":"33","author":"MU \u00dcnver","year":"2005","unstructured":"\u00dcnver, M.U.: On the survival of some unstable two-sided matching mechanisms. Int. J. Game Theor. 33(2), 239\u2013254 (2005)","journal-title":"Int. J. Game Theor."},{"key":"24_CR32","doi-asserted-by":"crossref","unstructured":"Viet, H.H., Trang, L.H., Lee, S., Chung, T.: A bidirectional local search for the stable marriage problem. In: 2016 International Conference on Advanced Computing and Applications (ACOMP), pp. 18\u201324. ieeexplore.ieee.org (November 2016)","DOI":"10.1109\/ACOMP.2016.013"},{"key":"24_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-30186-8_24","volume-title":"Distributed Computing","author":"M Wattenhofer","year":"2004","unstructured":"Wattenhofer, M., Wattenhofer, R.: Distributed weighted matching. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 335\u2013348. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30186-8_24"},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Zhao, D., Wang, H., Shao, K., Zhu, Y.: Deep reinforcement learning with experience replay based on SARSA. In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1\u20136. IEEE (2016)","DOI":"10.1109\/SSCI.2016.7849837"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:09:25Z","timestamp":1635289765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"58","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":"27","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":"47% - 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":"7","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}