{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:27Z","timestamp":1759638867170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_25","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"320-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Stable Marriage with Covering Constraints\u2013A Complete Computational Trichotomy"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Mnich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ildik\u00f3","family":"Schlotter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Arulselvan, A., Cseh, \u00c1., Gro\u00df, M., Manlove, D.F., Matuschke, J.: Matchings with lower quotas: algorithms and complexity. Algorithmica (2016)","DOI":"10.1007\/978-3-662-48971-0_16"},{"key":"25_CR2","unstructured":"Aziz, H., Seedig, H.G., von Wedel, J.K.: On the susceptibility of the deferred acceptance algorithm. In: Proceedings of AAMAS 2015, pp. 939\u2013947 (2015)"},{"issue":"8\u20139","key":"25_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0895-7177(92)90085-Y","volume":"16","author":"JJ Bartholdi III","year":"1992","unstructured":"Bartholdi III, J.J., Tovey, C.A., Trick, M.A.: How hard is it to control an election? Math. Comput. Modell. 16(8\u20139), 27\u201340 (1992)","journal-title":"Math. Comput. Modell."},{"issue":"34\u201336","key":"25_CR4","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.F.: The college admissions problem with lower and common quotas. Theoret. Comput. Sci. 411(34\u201336), 3136\u20133153 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1963190.1970372","volume":"16","author":"P Bir\u00f3","year":"2011","unstructured":"Bir\u00f3, P., Irving, R.W., Schlotter, I.: Stable matching with couples: an empirical study. ACM J. Exp. Algorithmics 16, 1\u20132 (2011)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.tcs.2012.01.022","volume":"432","author":"P Bir\u00f3","year":"2012","unstructured":"Bir\u00f3, P., Manlove, D.F., McDermid, E.J.: \u201cAlmost stable\u201d matchings in the roommates problem with bounded preference lists. Theoret. Comput. Sci. 432, 10\u201320 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T.: Pareto optimal matchings with lower quotas. In: Proceedings of COMSOC 2016 (2016)","DOI":"10.1016\/j.mathsocsci.2017.03.007"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.disopt.2016.03.002","volume":"20","author":"\u00c1 Cseh","year":"2016","unstructured":"Cseh, \u00c1., Manlove, D.F.: Stable marriage and roommates problems with restricted edges: complexity and approximability. Discret. Optim. 20, 62\u201389 (2016)","journal-title":"Discret. Optim."},{"key":"25_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015)"},{"issue":"1\u20133","key":"25_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/S0304-3975(03)00319-0","volume":"306","author":"VM Dias","year":"2003","unstructured":"Dias, V.M., da Fonseca, G.D., de Figueiredo, C.M., Szwarcfiter, J.L.: The stable marriage problem with restricted pairs. Theoret. Comput. Sci. 306(1\u20133), 391\u2013405 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR11","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. Theory 153, 648\u2013683 (2014)","journal-title":"J. Econ. Theory"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2007.04.029","volume":"381","author":"T Fleiner","year":"2007","unstructured":"Fleiner, T., Irving, R.W., Manlove, D.F.: Efficient algorithms for generalised stable marriage and roommates problems. Theor. Comput. Sci. 381, 162\u2013176 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1287\/moor.2015.0751","volume":"41","author":"T Fleiner","year":"2016","unstructured":"Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. Math. Oper. Res. 41(2), 734\u2013744 (2016)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2841226","volume":"4","author":"D Fragiadakis","year":"2016","unstructured":"Fragiadakis, D., Iwasaki, A., Troyan, P., Ueda, S., Yokoo, M.: Strategyproof matching with minimum quotas. ACM Trans. Econ. Comput. 4(1), 6 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"864","DOI":"10.3982\/TE2195","volume":"12","author":"D Fragiadakis","year":"2017","unstructured":"Fragiadakis, D., Troyan, P.: Improving matching under hard distributional constraints. Theoret. Econ. 12, 864\u2013908 (2017)","journal-title":"Theoret. Econ."},{"issue":"1","key":"25_CR16","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. Amer. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Amer. Math. Mon."},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discret. Appl. Math. 11(3), 223\u2013232 (1985)","journal-title":"Discret. Appl. Math."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2016.02.002","volume":"235","author":"M Goto","year":"2016","unstructured":"Goto, M., Iwasaki, A., Kawasaki, Y., Kurata, R., Yasuda, Y., Yokoo, M.: Strategyproof matching with regional minimum and maximum quotas. Artif. Intell. 235, 40\u201357 (2016)","journal-title":"Artif. Intell."},{"key":"25_CR19","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 (1989)"},{"issue":"1","key":"25_CR20","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"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Huang, C.-C.: Classified stable matching. In: Proceedings of SODA 2010, pp. 1235\u20131253 (2010)","DOI":"10.1137\/1.9781611973075.99"},{"key":"25_CR22","unstructured":"Immorlica, N., Mahdian, M.: Marriage, honesty, and stability. In: Proceedings of SODA 2005, pp. 53\u201362 (2005)"},{"issue":"4","key":"25_CR23","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. System Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. System Sci."},{"key":"25_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jda.2008.09.003","volume":"7","author":"RW Irving","year":"2009","unstructured":"Irving, R.W., Manlove, D., O\u2019Malley, G.: Stable marriage with ties and bounded length preference lists. J. Discret. Algorithms 7, 213\u2013219 (2009)","journal-title":"J. Discret. Algorithms"},{"issue":"5","key":"25_CR25","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.orl.2013.07.006","volume":"41","author":"N Kamiyama","year":"2013","unstructured":"Kamiyama, N.: A note on the serial dictatorship with project closures. Oper. Res. Lett. 41(5), 559\u2013561 (2013)","journal-title":"Oper. Res. Lett."},{"key":"25_CR26","volume-title":"Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires","author":"DE Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages stables et leurs relations avec d\u2019autres probl\u00e8mes combinatoires. Les Presses de l\u2019Universit\u00e9 de Montr\u00e9al, Montreal (1976)"},{"issue":"4","key":"25_CR27","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1093\/qje\/qjt019","volume":"128","author":"F Kojima","year":"2013","unstructured":"Kojima, F., Pathak, P.A., Roth, A.E.: Matching with couples: stability and incentives in large markets. Q. J. Econ. 128(4), 1585\u20131632 (2013)","journal-title":"Q. J. Econ."},{"issue":"2","key":"25_CR28","doi-asserted-by":"publisher","first-page":"683","DOI":"10.3982\/TE1839","volume":"11","author":"SD Kominers","year":"2016","unstructured":"Kominers, S.D., S\u00f6nmez, T.: Matching with slot-specific priorities: theory. Theoret. Econ. 11(2), 683\u2013710 (2016)","journal-title":"Theoret. Econ."},{"key":"25_CR29","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":"25_CR30","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"},{"key":"25_CR31","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, 25\u201340 (2011)","journal-title":"Discret. Optim."},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Mnich, M., Schlotter, I.: Stable marriage with covering constraints: a complete computational trichotomy (2017). https:\/\/arxiv.org\/abs\/1602.08230","DOI":"10.1007\/978-3-319-66700-3_25"},{"issue":"1","key":"25_CR33","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."},{"key":"25_CR34","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. Amer. Econ. Rev. 89, 748\u2013780 (1999)","journal-title":"Amer. Econ. Rev."},{"key":"25_CR35","unstructured":"Veskioja, T.: Stable marriage problem and college admission. Ph.D. thesis, Department of Informatics, Tallinn University of Technology (2005)"},{"issue":"3","key":"25_CR36","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00199-012-0704-4","volume":"53","author":"A Westkamp","year":"2013","unstructured":"Westkamp, A.: An analysis of the German University admissions system. Econ. Theory 53(3), 561\u2013589 (2013)","journal-title":"Econ. Theory"},{"issue":"1","key":"25_CR37","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1287\/moor.2016.0802","volume":"42","author":"Y Yokoi","year":"2017","unstructured":"Yokoi, Y.: A generalized polymatroid approach to stable matchings with lower quotas. Math. Oper. Res. 42(1), 238\u2013255 (2017)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:27:37Z","timestamp":1709828857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}