{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:35:44Z","timestamp":1775255744224,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030030971","type":"print"},{"value":"9783030030988","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03098-8_14","type":"book-chapter","created":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T08:27:33Z","timestamp":1540283253000},"page":"226-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Student-Project-Resource Allocation: Complexity of the Symmetric Case"],"prefix":"10.1007","author":[{"given":"Anisse","family":"Ismaili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoaki","family":"Yamaguchi","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":[[2018,10,24]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73\u201390 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, H., et al.: Stable matching with uncertain pairwise preferences. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pp. 344\u2013352 (2017)","DOI":"10.65109\/LTBE2008"},{"issue":"34\u201336","key":"14_CR3","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. Theor. Comput. Sci. 411(34\u201336), 3136\u20133153 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR4","first-page":"1","volume":"270","author":"M Chiarandini","year":"2017","unstructured":"Chiarandini, M., Fagerberg, R., Gualandi, S.: Handling preferences in student-project allocation. Ann. Oper. Res. 270, 1\u201314 (2017)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (JACM) 19(2), 248\u2013264 (1972)","journal-title":"J. ACM (JACM)"},{"key":"14_CR6","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"},{"issue":"12","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multiobjective knapsack problems. Manage. Sci. 48(12), 1603\u20131612 (2002)","journal-title":"Manage. Sci."},{"key":"14_CR8","first-page":"135","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Tam\u00e1s Fleiner","year":"2012","unstructured":"Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), pp. 135\u2013142 (2012)"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"6:1","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:1\u20136:40 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"issue":"1","key":"14_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., David Gale and Lloyd Stowell Shapley: College Admissions and the Stability of Marriage. Am. Math. Monthly 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"issue":"6","key":"14_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF01204168","volume":"28","author":"WI Gasarch","year":"1995","unstructured":"Gasarch, W.I., Krentel, M.W., Rappoport, K.J.: OptP as the normal behavior of NP-complete problems. Math. Syst. Theory 28(6), 487\u2013514 (1995)","journal-title":"Math. Syst. Theory"},{"key":"14_CR12","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."},{"issue":"2","key":"14_CR13","first-page":"226","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.: Microecon. 9(2), 226\u201362 (2017)","journal-title":"Am. Econ. J.: Microecon."},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"325","DOI":"10.3982\/TE1135","volume":"8","author":"IE Hafalir","year":"2013","unstructured":"Hafalir, I.E., Yenmez, M.B., Yildirim, M.A.: Effective affirmative action in school choice. Theor. Econ. 8(2), 325\u2013363 (2013)","journal-title":"Theor. Econ."},{"key":"14_CR15","first-page":"1","volume":"74","author":"K Hamada","year":"2014","unstructured":"Hamada, K., Iwama, K., Miyazaki, S.: The hospitals\/residents problem with lower quotas. Algorithmica 74, 1\u201326 (2014)","journal-title":"Algorithmica"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.artint.2017.04.006","volume":"249","author":"N Hamada","year":"2017","unstructured":"Hamada, N., Hsu, C.-L., Kurata, R., Suzuki, T., Ueda, S., Yokoo, M.: Strategy-proof school choice mechanisms with minimum quotas and initial endowments. Artif. Intell. 249, 47\u201371 (2017a)","journal-title":"Artif. Intell."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Hamada, N., Ismaili, A., Suzuki, T., Yokoo, M.: Weighted matching markets with budget constraints. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS, pp. 317\u2013325 (2017b)","DOI":"10.65109\/CKQZ4474"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Hosseini, H., Larson, K., Cohen, R.: On manipulablity of random serial dictatorship in sequential matching with dynamic preferences. In: Proceedings of the 29th Conference on Artificial Intelligence, AAAI, pp. 4168\u20134169 (2015)","DOI":"10.1609\/aaai.v29i1.9744"},{"issue":"1","key":"14_CR19","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."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Kawase, Y., Iwasaki, A.: Near-feasible stable matchings with budget constraints. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI, pp. 242\u2013248 (2017)","DOI":"10.24963\/ijcai.2017\/35"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.geb.2012.03.003","volume":"75","author":"F Kojima","year":"2012","unstructured":"Kojima, F.: School choice: impossibilities for affirmative action. Games Econ. Behav. 75(2), 685\u2013693 (2012)","journal-title":"Games Econ. Behav."},{"key":"14_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2018)"},{"key":"14_CR23","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":"14_CR24","doi-asserted-by":"crossref","unstructured":"Okumura, Y.: School choice with general constraints: a market design approach for the nursery school waiting list problem in Japan. (2017). mimeo (https:\/\/www.academia.edu\/19700640\/)","DOI":"10.2139\/ssrn.3176853"},{"key":"14_CR25","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2003","unstructured":"Papadimitriou, C.H.: Computational Complexity. John Wiley and Sons Ltd., Hoboken (2003)"},{"key":"14_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CCOL052139015X","volume-title":"Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis (Econometric Society Monographs)","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, Cambridge (1990)"},{"issue":"2","key":"14_CR27","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3982\/ECTA10570","volume":"81","author":"T S\u00f6nmez","year":"2013","unstructured":"S\u00f6nmez, T., Switzer, T.B.: Matching with (branch-of-choice) contracts at the united states military academy. Econometrica 81(2), 451\u2013488 (2013)","journal-title":"Econometrica"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1086\/669915","volume":"121","author":"T S\u00f6nmez","year":"2013","unstructured":"S\u00f6nmez, T.: Bidding for army career specialties: improving the ROTC branching mechanism. J. Polit. Econ. 121(1), 186\u2013219 (2013)","journal-title":"J. Polit. Econ."},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Ueda, S., Kitaki, M., Iwasaki, A., Yokoo, M.: Concise characteristic function representations in coalitional games based on agent types. In: The 10th International Conference on Autonomous Agents and Multiagent Systems-Volume 3, pp. 1271\u20131272. International Foundation for Autonomous Agents and Multiagent Systems (2011)","DOI":"10.65109\/NRFX1652"},{"key":"14_CR30","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2018: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03098-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T21:15:24Z","timestamp":1775250924000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03098-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030030971","9783030030988"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03098-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2018.prima-conference.org\/","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":"103","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":"25","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":"33","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":"24% - 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":"5","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)"}}]}}