{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:03:26Z","timestamp":1743098606011,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_25","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"390-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lazy Gale-Shapley for Many-to-One Matching with Partial Information"],"prefix":"10.1007","author":[{"given":"Taiki","family":"Todo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryoji","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kentaro","family":"Yahiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00199-014-0804-4","volume":"56","author":"MO Afacan","year":"2014","unstructured":"Afacan, M.O.: Fictitious students creation incentives in school choice problems. Econ. Theor. 56(3), 493\u2013514 (2014). https:\/\/doi.org\/10.1007\/s00199-014-0804-4","journal-title":"Econ. Theor."},{"issue":"5","key":"25_CR2","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1287\/mnsc.2018.3265","volume":"66","author":"I Ashlagi","year":"2020","unstructured":"Ashlagi, I., Braverman, M., Kanoria, Y., Shi, P.: Clearing matching markets efficiently: informative signals and match recommendations. Manage. Sci. 66(5), 2163\u20132193 (2020)","journal-title":"Manage. Sci."},{"key":"25_CR3","unstructured":"Aziz, H., et al.: Stable matching with uncertain pairwise preferences. In: Proceedings of the 16th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS-2017), pp. 344\u2013352 (2017)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6, 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jet.2009.07.004","volume":"145","author":"A Chakraborty","year":"2010","unstructured":"Chakraborty, A., Citanna, A., Ostrovsky, M.: Two-sided matching with interdependent values. J. Econ. Theor. 145(1), 85\u2013105 (2010)","journal-title":"J. Econ. Theor."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Drummond, J., Boutilier, C.: Preference elicitation and interview minimization in stable matchings. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI-2014), pp. 645\u2013653 (2014)","DOI":"10.1609\/aaai.v28i1.8829"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.3982\/ECTA10011","volume":"81","author":"F Echenique","year":"2013","unstructured":"Echenique, F., Lee, S., Shum, M., Yenmez, M.B.: The revealed preference theory of stable and extremal stable matchings. Econometrica 81(1), 153\u2013171 (2013)","journal-title":"Econometrica"},{"issue":"1","key":"25_CR8","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"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1016\/j.geb.2018.10.013","volume":"118","author":"YA Gonczarowski","year":"2019","unstructured":"Gonczarowski, Y.A., Nisan, N., Ostrovsky, R., Rosenbaum, W.: A stable marriage requires communication. Games Econ. Behav. 118, 626\u2013647 (2019)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1257\/mic.20160124","volume":"9","author":"M Goto","year":"2017","unstructured":"Goto, M., Kojima, F., Kurata, R., Tamura, A., Yokoo, M.: Designing matching mechanisms under general distributional constraints. Am. Econ. J. Microeconomics 9(2), 226\u201362 (2017)","journal-title":"Am. Econ. J. Microeconomics"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44985-X_24","volume-title":"Algorithm Theory","author":"RW Irving","year":"2000","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The Hospitals\/Residents problem with ties. In: SWAT 2000. LNCS, vol. 1851, pp. 259\u2013271. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44985-X_24"},{"issue":"11","key":"25_CR12","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558\u2013562 (1962)","journal-title":"Commun. ACM"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1257\/aer.20101552","volume":"105","author":"Y Kamada","year":"2015","unstructured":"Kamada, Y., Kojima, F.: Efficient matching under distributional constraints: theory and applications. Am. Econ. Rev. 105(1), 67\u201399 (2015)","journal-title":"Am. Econ. Rev."},{"issue":"4","key":"25_CR14","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"issue":"1\/2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1613\/jair.5297","volume":"58","author":"R Kurata","year":"2017","unstructured":"Kurata, R., Hamada, N., Iwasaki, A., Yokoo, M.: Controlled school choice with soft bounds and overlapping types. J. Artif. Intell. Res. 58, 153\u2013184 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Lee, R.S., Schwarz, M.: Interviewing in two-sided matching markets. Technical report, National Bureau of Economic Research (2009)","DOI":"10.3386\/w14922"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mallows, C.L.: Non-null ranking models. I. Biometrika 44(1\u20132), 114\u2013130 (1957)","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientifc, Singapore (2013)","DOI":"10.1142\/8591"},{"issue":"1","key":"25_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1137\/0219004","volume":"19","author":"C Ng","year":"1990","unstructured":"Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM J. Comput. 19(1), 71\u201377 (1990)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"25_CR21","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10458-010-9121-x","volume":"22","author":"MS Pini","year":"2011","unstructured":"Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Manipulation complexity and gender neutrality in stable marriage procedures. Auton. Agent. Multi-Agent Syst. 22(1), 183\u2013199 (2011)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Rastegari, B., Condon, A., Immorlica, N., Irving, R., Leyton-Brown, K.: Reasoning about optimal stable matchings under partial information. In: Proceedings of the 15th ACM Conference on Economics and Computation (EC-2014), pp. 431\u2013448 (2014)","DOI":"10.1145\/2600057.2602884"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Rastegari, B., Condon, A., Immorlica, N., Leyton-Brown, K.: Two-sided matching with partial information. In: Proceedings of the 14th ACM Conference on Economics and Computation (EC-2013), pp. 733\u2013750 (2013)","DOI":"10.1145\/2482540.2482607"},{"key":"25_CR24","unstructured":"Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. No. 18, Cambridge University Press, Cambridge (1992)"},{"issue":"9","key":"25_CR25","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/mnsc.47.9.1252.9784","volume":"47","author":"CP Teo","year":"2001","unstructured":"Teo, C.P., Sethuraman, J., Tan, W.P.: Gale-Shapley stable marriage problem revisited: strategic issues and applications. Manage. Sci. 47(9), 1252\u20131267 (2001)","journal-title":"Manage. Sci."},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Tubbs, J.: Distance based binary matching. In: Page C., LePage R. (eds.) Computing Science and Statistics, pp. 548\u2013550. Springer, New York (1992) https:\/\/doi.org\/10.1007\/978-1-4612-2856-1_97","DOI":"10.1007\/978-1-4612-2856-1_97"},{"issue":"2","key":"25_CR27","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1137\/0135023","volume":"35","author":"HP Young","year":"1978","unstructured":"Young, H.P., Levenglick, A.: A consistent extension of Condorcet\u2019s election principle. SIAM J. Appl. Math. 35(2), 285\u2013300 (1978)","journal-title":"SIAM J. Appl. Math."}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:43Z","timestamp":1673647303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_25","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)"}}]}}