{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:37:46Z","timestamp":1772908666021,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031333736","type":"print"},{"value":"9783031333743","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T00:00:00Z","timestamp":1685145600000},"content-version":"vor","delay-in-days":146,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Group work is a prevalent activity in educational settings, where students are often divided into topic-specific groups based on their preferences. The grouping should reflect students\u2019 aspirations as much as possible. Usually, the resulting groups should also be balanced in terms of protected attributes like gender, as studies suggest that students may learn better in mixed-gender groups. Moreover, to allow a fair workload across the groups, the cardinalities of the different groups should be balanced. In this paper, we introduce a <jats:italic>multi-fair capacitated<\/jats:italic> (MFC) grouping problem that fairly partitions students into non-overlapping groups while ensuring balanced group cardinalities (with a lower and an upper bound), and maximizing the diversity of members regarding the protected attribute. To obtain the MFC grouping, we propose three approaches: a greedy heuristic approach, a knapsack-based approach using vanilla maximal knapsack formulation, and an MFC knapsack approach based on group fairness knapsack formulation. Experimental results on a real dataset and a semi-synthetic dataset show that our proposed methods can satisfy students\u2019 preferences and deliver balanced and diverse groups regarding cardinality and the protected attribute, respectively.<\/jats:p>","DOI":"10.1007\/978-3-031-33374-3_40","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"507-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-fair Capacitated Students-Topics Grouping Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8512-5854","authenticated-orcid":false,"given":"Tai","family":"Le Quy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3878-9230","authenticated-orcid":false,"given":"Gunnar","family":"Friege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5729-1003","authenticated-orcid":false,"given":"Eirini","family":"Ntoutsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Golshan, B., Terzi, E.: Grouping students in educational settings. In: KDD, pp. 1017\u20131026 (2014)","DOI":"10.1145\/2623330.2623748"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Bouchard Jr, T.J., Hare, M.: Size, performance, and potential in brainstorming groups. J. Appl. Psychol. 54(1p1), 51 (1970)","DOI":"10.1037\/h0028621"},{"key":"40_CR3","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: NeurIPS, pp. 5036\u20135044 (2017)"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1111\/1468-0432.00129","volume":"8","author":"GD Fenwick","year":"2001","unstructured":"Fenwick, G.D., Neal, D.J.: Effect of gender composition on group performance. Gender Work Organization 8(2), 205\u2013225 (2001)","journal-title":"Gender Work Organization"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Fluschnik, T., Skowron, P., Triphaus, M., Wilker, K.: Fair knapsack. In: AAAI, vol. 33, pp. 1941\u20131948 (2019)","DOI":"10.1609\/aaai.v33i01.33011941"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Ford, M., Morice, J.: How fair are group assignments? a survey of students and faculty and a modest proposal. J. Inf. Technol. Educ. Res. 2(1), 367\u2013378 (2003)","DOI":"10.28945\/335"},{"issue":"3","key":"40_CR7","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1111\/j.1540-5915.1999.tb00910.x","volume":"30","author":"D Hartvigsen","year":"1999","unstructured":"Hartvigsen, D., Wei, J.C., Czuchlewski, R.: The conference paper-reviewer assignment problem. Decis. Sci. 30(3), 865\u2013876 (1999)","journal-title":"Decis. Sci."},{"issue":"2","key":"40_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/inte.1050.0194","volume":"36","author":"D Krass","year":"2006","unstructured":"Krass, D., Ovchinnikov, A.: The university of Toronto\u2019s rotman school of management uses management science to create MBA study groups. Interfaces 36(2), 126\u2013137 (2006)","journal-title":"Interfaces"},{"key":"40_CR9","unstructured":"Le Quy, T., Roy, A., Friege, G., Ntoutsi, E.: Fair-capacitated clustering. In: The 14th International Conference on Educational Data Mining, pp. 407\u2013414 (2021)"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Le Quy, T., Roy, A., Vasileios, I., Wenbin, Z., Ntoutsi, E.: A survey on datasets for fairness-aware machine learning. WIREs Data Min. Knowl. Discov. 12(3) (2022)","DOI":"10.1002\/widm.1452"},{"issue":"6","key":"40_CR11","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1287\/inte.1080.0373","volume":"38","author":"L Lopes","year":"2008","unstructured":"Lopes, L., Aronson, M., Carstensen, G., Smith, C.: Optimization support for senior design project assignments. Interfaces 38(6), 448\u2013464 (2008)","journal-title":"Interfaces"},{"issue":"3","key":"40_CR12","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1287\/inte.2017.0940","volume":"48","author":"TL Magnanti","year":"2018","unstructured":"Magnanti, T.L., Natarajan, K.: Allocating students to multidisciplinary capstone projects using discrete optimization. Interfaces 48(3), 204\u2013216 (2018)","journal-title":"Interfaces"},{"issue":"1","key":"40_CR13","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1112\/plms\/s1-28.1.486","volume":"1","author":"GB Mathews","year":"1896","unstructured":"Mathews, G.B.: On the partition of numbers. Proc. Lond. Math. Soc. 1(1), 486\u2013490 (1896)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"1","key":"40_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1177\/1059601198231005","volume":"23","author":"JA Miles","year":"1998","unstructured":"Miles, J.A., Klein, H.J.: The fairness of assigning group members to tasks. Group Organization Manage. 23(1), 71\u201396 (1998)","journal-title":"Group Organization Manage."},{"issue":"3","key":"40_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"JM Mulvey","year":"1984","unstructured":"Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18(3), 339\u2013348 (1984)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"40_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"JF Nash","year":"1950","unstructured":"Nash, J.F.: The bargaining problem. Econometrica 18(2), 155\u2013162 (1950)","journal-title":"Econometrica"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Oliveira, M., Karimi, F., Zens, M., Schaible, J., G\u00e9nois, M., Strohmaier, M.: Group mixing drives inequality in face-to-face gatherings. Commun. Phys. 5(1) (2022)","DOI":"10.1038\/s42005-022-00896-1"},{"key":"40_CR18","unstructured":"Patel, D., Khan, A., Louis, A.: Group fairness for knapsack problems. In: AAMAS, pp. 1001\u20131009 (2021)"},{"key":"40_CR19","doi-asserted-by":"crossref","unstructured":"Rezaeinia, N., G\u00f3ez, J.C., Guajardo, M.: Efficiency and fairness criteria in the assignment of students to projects. Annals of Operations Research, pp. 1\u201319 (2021)","DOI":"10.1007\/s10479-021-04001-7"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Stahl, F., Vossen, G.: Fair knapsack pricing for data marketplaces. In: ADBIS, pp. 46\u201359. Springer (2016)","DOI":"10.1007\/978-3-319-44039-2_4"},{"issue":"5","key":"40_CR21","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1002\/cae.21839","volume":"25","author":"AB Urbina N\u00e1jera","year":"2017","unstructured":"Urbina N\u00e1jera, A.B., De La Calleja, J., Medina, M.A.: Associating students and teachers for tutoring in higher education using clustering and data mining. Comput. Appl. Eng. Educ. 25(5), 823\u2013832 (2017)","journal-title":"Comput. Appl. Eng. Educ."},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"Yetton, P., Bottger, P.: The relationships among group size, member ability, social decision schemes, and performance. Organ. Behav. Hum. Perform. 32(2) (1983)","DOI":"10.1016\/0030-5073(83)90144-7"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33374-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:06:06Z","timestamp":1710360366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33374-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333736","9783031333743"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33374-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"813","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":"143","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":"18% - 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.5","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)"}}]}}