New algorithm eliminates 100% of team formation complaints in 238-student test
GPA variance dropped to 0.005 with 94.3% preference satisfaction
A new research paper from arXiv presents a novel two-phase algorithmic approach that decouples preference satisfaction from fairness optimization in student team formation, achieving both objectives without compromise. The method applies simulated annealing—a core materials science technique—to an educational challenge. Phase 1 forms fixed triads through graph-theoretic clustering that maximizes mutual preferences, preserving social bonds. Phase 2 employs simulated annealing to pair triads into teams of six while optimizing GPA variance, gender balance, and size constraints.
Deployed across 238 students, the algorithm eliminated formal complaints entirely (compared to a historical baseline of over 30%), achieved GPA variance of 0.005 (versus historical mean 9.74), eliminated gender-isolated individuals, and maintained 94.3% preference satisfaction. Validation against 82 historical grouping instances spanning 1,538 teams over six academic years confirmed significant improvement over conventional methods such as CATME and self-selection, which typically yield complaint rates of 5–35%.
- 100% elimination of formal complaints in a 238-student deployment (vs >30% baseline)
- GPA variance reduced to 0.005 from a historical mean of 9.74
- 94.3% preference satisfaction while achieving gender balance and zero isolated individuals
Why It Matters
Transforms team formation from a major administrative headache into a scalable, equitable, and complaint-free process.