{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:31:20Z","timestamp":1762918280927,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T00:00:00Z","timestamp":1636416000000},"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":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10458-021-09533-7","type":"journal-article","created":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T06:08:56Z","timestamp":1636438136000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Candidate selections with proportional fairness constraints"],"prefix":"10.1007","volume":"36","author":[{"given":"Xiaohui","family":"Bei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5786-6938","authenticated-orcid":false,"given":"Shengxin","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Chung Keung","family":"Poon","sequence":"additional","affiliation":[]},{"given":"Hongao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"issue":"4","key":"9533_CR1","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s00182-005-0215-7","volume":"33","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A. (2005). College admissions with affirmative action. International Journal of Game Theory, 33(4), 535\u2013549.","journal-title":"International Journal of Game Theory"},{"key":"9533_CR2","doi-asserted-by":"crossref","unstructured":"Ashlagi, I., Saberi, A., & Shameli, A. (2019). Assignment mechanisms under distributional constraints. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (pp. 229\u2013240)","DOI":"10.1137\/1.9781611975482.15"},{"issue":"6","key":"9533_CR3","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1007\/s10726-019-09634-5","volume":"28","author":"H Aziz","year":"2019","unstructured":"Aziz, H. (2019). A rule for committee selection with soft diversity constraints. Group Decision and Negotiation, 28(6), 1193\u20131200.","journal-title":"Group Decision and Negotiation"},{"key":"9533_CR4","unstructured":"Aziz, H., Gaspers, S., Sun, Z., & Walsh, T. (2019). From matching with diversity constraints to matching with regional quotas. In: Proceedings of the International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), (pp. 377\u2013385)"},{"key":"9533_CR5","unstructured":"Bei, X., Liu, S., Poon, C. K., & Wang, H. (2020). Candidate selections with proportional fairness constraints. In: Proceedings of the International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), (pp. 150\u2013158)"},{"key":"9533_CR6","doi-asserted-by":"publisher","first-page":"103436","DOI":"10.1016\/j.artint.2020.103436","volume":"293","author":"X Bei","year":"2021","unstructured":"Bei, X., Li, Z., Liu, J., Liu, S., & Lu, X. (2021). Fair division of mixed divisible and indivisible goods. Artificial Intelligence, 293, 103436.","journal-title":"Artificial Intelligence"},{"key":"9533_CR7","unstructured":"Benabbou, N., Chakraborty, M., Ho, X. V., Sliwinski, J., & Zick, Y. (2018). Diversity constraints in public housing allocation. In: Proceedings of the International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), (pp. 973\u2013981)"},{"issue":"34","key":"9533_CR8","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. (2010). The college admissions problem with lower and common quotas. Theoretical Computer Science, 411(34), 3136\u20133153.","journal-title":"Theoretical Computer Science"},{"key":"9533_CR9","doi-asserted-by":"crossref","unstructured":"Bredereck, R., Faliszewski, P., Igarashi, A., Lackner, M., & Skowron, P. (2018). Multiwinner elections with diversity constraints. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) (pp. 933\u2013940)","DOI":"10.1609\/aaai.v32i1.11457"},{"issue":"6","key":"9533_CR10","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E. (2011). The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy, 119(6), 1061\u20131103.","journal-title":"Journal of Political Economy"},{"issue":"6","key":"9533_CR11","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., & Vondr\u00e1k, J. (2011). Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6), 1740\u20131766.","journal-title":"SIAM Journal on Computing"},{"key":"9533_CR12","doi-asserted-by":"crossref","unstructured":"Celis, L. E., Huang, L., & Vishnoi, N. K. (2018). Multiwinner voting with fairness constraints. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (pp. 144\u2013151)","DOI":"10.24963\/ijcai.2018\/20"},{"key":"9533_CR13","doi-asserted-by":"crossref","unstructured":"Chen, J., Ganian, R., & Hamm, T. (2021). Stable matchings with diversity constraints: Affirmative action is beyond NP. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (pp. 146\u2013152)","DOI":"10.24963\/ijcai.2020\/21"},{"key":"9533_CR14","unstructured":"Cowen Institue (2011) Case studies of school choice and open enrollment in four cities"},{"key":"9533_CR15","doi-asserted-by":"crossref","unstructured":"Ehlers, L., Hafalir, I. E., Yenmez, M. B., & Yildirim, M. A. (2014). School choice with controlled choice constraints: Hard bounds versus soft bounds. Journal of Economic Theory, 153 (C):648\u2013683,","DOI":"10.1016\/j.jet.2014.03.004"},{"key":"9533_CR16","unstructured":"Faliszewski P, Skowron P, Slinko A, & Talmon N (2017) Multiwinner voting: A new challenge for social choice theory. In: Endriss U (ed) Trends in Computational Social Choice, AI Access Foundation, chap\u00a02"},{"key":"9533_CR17","unstructured":"Faliszewski, P., Slinko, A., & Talmon, N. (2020). Multiwinner rules with variable number of winners. In: Proceedings of the European Conference on Artificial Intelligence (ECAI), (pp. 67\u201374)"},{"issue":"2","key":"9533_CR18","doi-asserted-by":"publisher","first-page":"863","DOI":"10.3982\/TE2195","volume":"12","author":"D Fragiadakis","year":"2017","unstructured":"Fragiadakis, D., & Troyan, P. (2017). Improving matching under hard distributional constraints. Theoretical Economics, 12(2), 863\u2013908.","journal-title":"Theoretical Economics"},{"issue":"2","key":"9533_CR19","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. (2013). Effective affirmative action in school choice. Theoretical Economics, 8(2), 325\u2013363.","journal-title":"Theoretical Economics"},{"key":"9533_CR20","doi-asserted-by":"crossref","unstructured":"Jiang, S., Song, Z., Weinstein, O., & Zhang, H. (2021). A faster algorithm for solving general LPs. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), (pp. 823\u2013832)","DOI":"10.1145\/3406325.3451058"},{"key":"9533_CR21","doi-asserted-by":"crossref","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In: Proceedings of a symposium on the Complexity of Computer Computations, In: Proceedings of a symposium on the Complexity of Computer Computations, (pp. 85\u2013103)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"9533_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11238-016-9535-2","volume":"81","author":"DM Kilgour","year":"2016","unstructured":"Kilgour, D. M. (2016). Approval elections with a variable number of winners. Theory and Decision, 81(2), 199\u2013211.","journal-title":"Theory and Decision"},{"issue":"6","key":"9533_CR23","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00493-012-2760-6","volume":"32","author":"T Kir\u00e1ly","year":"2012","unstructured":"Kir\u00e1ly, T., Lau, L. C., & Singh, M. (2012). Degree bounded matroids and submodular flows. Combinatorica, 32(6), 703\u2013720.","journal-title":"Combinatorica"},{"key":"9533_CR24","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jet.2018.05.004","volume":"176","author":"F Kojima","year":"2018","unstructured":"Kojima, F., Tamura, A., & Yokoo, M. (2018). Designing matching mechanisms under constraints: An approach from discrete convex analysis. Journal of Economic Theory, 176, 803\u2013833.","journal-title":"Journal of Economic Theory"},{"key":"9533_CR25","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., & Makoto, Y. (2017). Controlled school choice with soft bounds and overlapping types. Journal of Artificial Intelligent Research, 58, 153\u2013184.","journal-title":"Journal of Artificial Intelligent Research"},{"key":"9533_CR26","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.artint.2018.07.005","volume":"263","author":"J Lang","year":"2018","unstructured":"Lang, J., & Skowron, P. (2018). Multi-attribute proportional representation. Artificial Intelligence, 263, 74\u2013106.","journal-title":"Artificial Intelligence"},{"key":"9533_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization","author":"LC Lau","year":"2011","unstructured":"Lau, L. C., Ravi, R., & Singh, M. (2011). Iterative Methods in Combinatorial Optimization (1st ed.). London: Cambridge University Press.","edition":"1"},{"issue":"6","key":"9533_CR28","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1287\/opre.2019.1909","volume":"67","author":"T Nguyen","year":"2019","unstructured":"Nguyen, T., & Vohra, R. (2019). Stable matching with proportionality constraints. Operations Research, 67(6), 1503\u20131519.","journal-title":"Operations Research"},{"issue":"1","key":"9533_CR29","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H. (1948). The problem of fair division. Econometrica, 16(1), 101\u2013104.","journal-title":"Econometrica"},{"key":"9533_CR30","unstructured":"Suzuki, T., Tamura, A., & Yokoo, M. (2018). Efficient allocation mechanism with endowments and distributional constraints. In: Proceedings of the International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), (pp. 50\u201358)"},{"key":"9533_CR31","doi-asserted-by":"crossref","unstructured":"Yang, Y., & Wang, J. (2018). Multiwinner voting with restricted admissible sets: Complexity and strategyproofness. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), (pp. 576\u2013582)","DOI":"10.24963\/ijcai.2018\/80"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09533-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-021-09533-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-021-09533-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T18:52:17Z","timestamp":1673722337000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-021-09533-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,9]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9533"],"URL":"https:\/\/doi.org\/10.1007\/s10458-021-09533-7","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"type":"print","value":"1387-2532"},{"type":"electronic","value":"1573-7454"}],"subject":[],"published":{"date-parts":[[2021,11,9]]},"assertion":[{"value":"14 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}