REAL

Automated fair team formation in STEAM activities using Satisfiability Modulo Theories (SMT)

Adil, Ali Adil and Kovásznai, Gergely and Khalid, Mustafa (2025) Automated fair team formation in STEAM activities using Satisfiability Modulo Theories (SMT). ANNALES MATHEMATICAE ET INFORMATICAE, 61. pp. 1-14. ISSN 1787-6117

[img]
Preview
Text
1_14_adil.pdf - Published Version

Download (784kB) | Preview

Abstract

One of the problems that schools or organizers of STEAM (Science, Technology, Engineering, Arts, and Mathematics) camps face to is the balanced distribution of students according to gender, skills, and academic background in a fair manner. In this study, we used a Satisfiability Modulo Theories (SMT) approach to solve the problem of fair team formation. Our implementation of the approach uses the Z3 SMT solver. In our preliminary experiments, we successfully generated fair and balanced teams from 50 students across different scenarios. Using SMT in educational settings saves time and effort for school administrators and organizers of STEAM events, and it also provides an efficient and effective solution to distribute students equitably across teams.

Item Type: Article
Uncontrolled Keywords: Automated Team Formation, Fairness, STEAM Education, Satisfiability Modulo Theories (SMT)
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Tibor Gál
Date Deposited: 11 Nov 2025 11:00
Last Modified: 11 Nov 2025 11:00
URI: https://real.mtak.hu/id/eprint/228818

Actions (login required)

Edit Item Edit Item