{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:11:23Z","timestamp":1743106283759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_3","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"31-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper Quotas"],"prefix":"10.1007","author":[{"given":"Niclas","family":"Boehmer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Heeger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1007\/s10878-016-0085-x","volume":"32","author":"KC \u00c1goston","year":"2016","unstructured":"\u00c1goston, K.C., Bir\u00f3, P., McBride, I.: Integer programming methods for special college admissions problems. J. Comb. Optim. 32(4), 1371\u20131399 (2016). https:\/\/doi.org\/10.1007\/s10878-016-0085-x","journal-title":"J. Comb. Optim."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00453-016-0252-6","volume":"80","author":"A Arulselvan","year":"2018","unstructured":"Arulselvan, A., Cseh, \u00c1., Gro\u00df, M., Manlove, D.F., Matuschke, J.: Matchings with lower quotas: algorithms and complexity. Algorithmica 80(1), 185\u2013208 (2018)","journal-title":"Algorithmica"},{"key":"3_CR3","unstructured":"Aziz, H., Gaspers, S., Sun, Z., Walsh, T.: From matching with diversity constraints to matching with regional quotas. In: AAMAS 2019, pp. 377\u2013385 (2019)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, H., Savani, R.: Hedonic games. In: Handbook of Computational Social Choice, pp. 356\u2013376 (2016)","DOI":"10.1017\/CBO9781107446984.016"},{"issue":"34\u201336","key":"3_CR5","doi-asserted-by":"publisher","first-page":"3136","DOI":"10.1016\/j.tcs.2010.05.005","volume":"411","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., Fleiner, T., Irving, R.W., Manlove, D.: The college admissions problem with lower and common quotas. Theor. Comput. Sci. 411(34\u201336), 3136\u20133153 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-319-07959-2_2","volume-title":"Experimental Algorithms","author":"P Bir\u00f3","year":"2014","unstructured":"Bir\u00f3, P., Manlove, D.F., McBride, I.: The hospitals\/residents problem with couples: complexity and integer programming models. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 10\u201321. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07959-2_2"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Heeger, K.: A fine-grained view on stable many-to-one matching problems with lower and upper quotas. CoRR abs\/2009.14171 (2020)","DOI":"10.1007\/978-3-030-64946-3_3"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.mathsocsci.2017.03.007","volume":"88","author":"K Cechl\u00e1rov\u00e1","year":"2017","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: Pareto optimal matchings with lower quotas. Math. Soc. Sci. 88, 3\u201310 (2017)","journal-title":"Math. Soc. Sci."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.jet.2014.03.004","volume":"153","author":"L Ehlers","year":"2014","unstructured":"Ehlers, L., Hafalir, I.E., Yenmez, M.B., Yildirim, M.A.: School choice with controlled choice constraints: hard bounds versus soft bounds. J. Econ. Theor. 153, 648\u2013683 (2014)","journal-title":"J. Econ. Theor."},{"issue":"1","key":"3_CR10","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. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/s00453-014-9951-z","volume":"74","author":"K Hamada","year":"2016","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: The hospitals\/residents problem with lower quotas. Algorithmica 74(1), 440\u2013465 (2016)","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the \u201cstable roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"3_CR13","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."},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"3_CR15","series-title":"Series on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. Series on Theoretical Computer Science, vol. 2. World Scientific, Singapore (2013)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s00453-009-9326-z","volume":"58","author":"D Marx","year":"2010","unstructured":"Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170\u2013187 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.disopt.2010.07.004","volume":"8","author":"D Marx","year":"2011","unstructured":"Marx, D., Schlotter, I.: Stable assignment with couples: parameterized complexity and local search. Discret. Optim. 8(1), 25\u201340 (2011)","journal-title":"Discret. Optim."},{"issue":"5","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1007\/s00453-019-00636-y","volume":"82","author":"M Mnich","year":"2020","unstructured":"Mnich, M., Schlotter, I.: Stable matchings with covering constraints: a complete computational trichotomy. Algorithmica 82(5), 1136\u20131188 (2020)","journal-title":"Algorithmica"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.econlet.2013.03.007","volume":"120","author":"D Monte","year":"2013","unstructured":"Monte, D., Tumennasan, N.: Matching with quorums. Econ. Lett. 120(1), 14\u201317 (2013)","journal-title":"Econ. Lett."},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.S.: Three-dimensional stable matching problems. SIAM J. Discret. Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"3_CR21","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"issue":"3\u20134","key":"3_CR22","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s00182-008-0117-6","volume":"36","author":"AE Roth","year":"2008","unstructured":"Roth, A.E.: Deferred acceptance algorithms: history, theory, practice, and open questions. Int. J. Game Theor. 36(3\u20134), 537\u2013569 (2008)","journal-title":"Int. J. Game Theor."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T18:25:29Z","timestamp":1618597529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"11","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":"23% - 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":"10","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)"}}]}}