Strategies

Partition projects across course lab sections using the Gale-Shapley algorithm before student-to-project assignment

Strategy · All strategies
Evidence · no claims cited

Description

To support courses with labs, the article describes a supplementary algorithm run before the main assignment: it computes teams needed per lab from an instructor-defined base team size, then treats lab-to-project allocation as "a version of the college admissions problem, solvable via the Gale-Shapley algorithm," seeking a stable matching without blocking pairs. Labs rank projects by average student preference; projects rank labs by average lab skill frequency of their required skills. This ensures all students on a project share a lab, facilitating consistent collaboration, after which the main skill-weighted algorithm runs within each lab.

Design Implications

Context

Requirements

Constraints

Target Learners

Target Learning Goals

Affordances

Examples

-

Key Sources

Page metadata
Field Value
type strategy
id gale-shapley-lab-project-partitioning
title Partition projects across course lab sections using the Gale-Shapley algorithm before student-to-project assignment
description To support courses with labs, the article describes a supplementary algorithm run before the main assignment: it computes teams needed per lab from an instructor-defined base team size, then treats lab-to-project allo...
status review
generated by process:wiki-ingest on 2026-10-10
trust unverified — no one has confirmed this page's content
sources 1 — brandon-pardi-2026

Frontmatter is the page's machine-readable record — see the Schema & Guide.