{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:43:02Z","timestamp":1742960582940,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389375"},{"type":"electronic","value":"9783031389382"}],"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-38938-2_4","type":"book-chapter","created":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:01:49Z","timestamp":1693134109000},"page":"51-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MatchMaker: A DSL for\u00a0Game-Theoretic Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3452-2558","authenticated-orcid":false,"given":"Prashant","family":"Kumar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7471-4554","authenticated-orcid":false,"given":"Martin","family":"Erwig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. Journal of Economic Theory 100(2), 295\u2013328 (2001)","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.ejor.2019.03.017","volume":"277","author":"M Delorme","year":"2019","unstructured":"Delorme, M., Garc\u00eda, S., Gondzio, J., Kalcsics, J., Manlove, D., Pettersson, D.: Mathematical models for stable matching problems with ties and incomplete lists. European Journal of Operational Research 277(2), 426\u2013441 (2019)","journal-title":"European Journal of Operational Research"},{"key":"4_CR3","unstructured":"Drummond, J., Perrault, A., Bacchus, F.: Sat is an effective and complete method for solving stable matching problems with couples. In: Proceedings of the 24th International Conference on Artificial Intelligence. p. 518\u2013525. IJCAI\u201915, AAAI Press (2015)"},{"issue":"1","key":"4_CR4","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. The American Mathematical Monthly 69(1), 9\u201315 (1962)","journal-title":"The American Mathematical Monthly"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Gent, I.P., Irving, R.W., Manlove, D., Prosser, P., Smith, B.M.: A constraint programming approach to the stable marriage problem. In: Proc. of the 7th International Conference on Principles and Practice of Constraint Programming. p. 225\u2013239. CP \u201901, Springer-Verlag (2001)","DOI":"10.1007\/3-540-45578-7_16"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/0217048","volume":"17","author":"D Gusfield","year":"1988","unstructured":"Gusfield, D.: The structure of the stable roommate problem: Efficient representation and enumeration of all stable assignments. SIAM Journal on Computing 17(4), 742\u2013769 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR7","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, USA (1989)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. Journal of Algorithms 6(4), 577\u2013595 (1985)","DOI":"10.1016\/0196-6774(85)90033-1"},{"issue":"3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1137\/0215048","volume":"15","author":"RW Irving","year":"1986","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM Journal on Computing 15(3), 655\u2013667 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR10","unstructured":"Klein, T., Aue, R., Giegerich, S., Sauer, A.: matchingMarkets: Analysis of Stable Matchings in R (2020), https:\/\/matchingmarkets.org\/"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific (2013)","DOI":"10.1142\/8591"},{"key":"4_CR12","unstructured":"NRMP: National Resident Matching Program (2022), https:\/\/www.nrmp.org\/intro-to-the-match\/how-matching-algorithm-works\/"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Prosser, P.: Stable roommates and constraint programming. In: CPAIOR (2014)","DOI":"10.1007\/978-3-319-07046-9_2"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Roth, A.E.: Deferred acceptance algorithms: History, theory, practice, and open questions. Working Paper 13225, National Bureau of Economic Research (2007)","DOI":"10.3386\/w13225"},{"issue":"4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1257\/aer.89.4.748","volume":"89","author":"AE Roth","year":"1999","unstructured":"Roth, A.E., Peranson, E.: The redesign of the matching market for american physicians: Some engineering aspects of economic design. American Economic Review 89(4), 748\u2013780 (1999)","journal-title":"American Economic Review"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"AE Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. The Quarterly Journal of Economics 119(2), 457\u2013488 (2004)","journal-title":"The Quarterly Journal of Economics"},{"key":"4_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Econometric Society Monographs, Cambridge University Press (1990)"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. Journal of Mathematical Economics 1(1), 23\u201337 (1974)","journal-title":"Journal of Mathematical Economics"},{"key":"4_CR19","unstructured":"Tilly, J., Janetos, N.: matchingR: Matching Algorithms in R and C++ (2020), https:\/\/github.com\/jtilly\/matchingR\/"},{"issue":"48","key":"4_CR20","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.21105\/joss.02169","volume":"5","author":"H Wilde","year":"2020","unstructured":"Wilde, H., Knight, V., Gillard, J.: Matching: A python library for solving matching games. Journal of Open Source Software 5(48), 2169 (2020)","journal-title":"Journal of Open Source Software"},{"issue":"19","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1056\/NEJM198105073041910","volume":"304","author":"KJ Williams","year":"1981","unstructured":"Williams, K.J., Werth, V.P., Wolff, J.A.: An analysis of the resident match. New England Journal of Medicine 304(19), 1165\u20131166 (1981)","journal-title":"New England Journal of Medicine"}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38938-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:02:28Z","timestamp":1693134148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38938-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389375","9783031389382"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38938-2_4","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":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"12 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/trendsfp.github.io\/index.html","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":"14","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":"6","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":"43% - 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)"}}]}}