mlsanityData to 14 Oct 2026

Machine Learning-Powered Course Allocation

arXiv 2210.00954 ↗First posted 3 Oct 2022cs.GT cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

We study the course allocation problem, where universities assign course schedules to students. The current state-of-the-art mechanism, Course Match, has one major shortcoming: students make significant mistakes when reporting their preferences, which negatively affects welfare and fairness. To address this issue, we introduce a new mechanism, Machine Learning-powered Course Match (MLCM). At the core of MLCM is a machine learning-powered preference elicitation module that iteratively asks personalized pairwise comparison queries to alleviate students' reporting mistakes. Extensive computational experiments, grounded in real-world data, demonstrate that MLCM, with only ten comparison queries, significantly increases both average and minimum student utility by 7%-11% and 17%-29%, respectively. Finally, we highlight MLCM's robustness to changes in the environment and show how our design minimizes the risk of upgrading to MLCM while making the upgrade process simple for universities and seamless for their students.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 9 of its 47 references that are in the map. First posted on arXiv 3 Oct 2022.

Builds on

9 of 47 references.

References · 9

  1. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
  2. 2021NOMU: Neural Optimization-based Model Uncertaintycited by 16
  3. 2014Eliciting Single-Peaked Preferences Using Comparison Queriescited by 12
  4. 2019Deep Learning-powered Iterative Combinatorial Auctionscited by 12
  5. 2019Machine Learning-powered Iterative Combinatorial Auctionscited by 11
  6. 2022Bayesian Optimization-based Combinatorial Assignmentcited by 9
  7. 2021Monotone-Value Neural Networks: Exploiting Preference Monotonicity in Combinatorial Assignmentcited by 8
  8. 2020Fourier Analysis-based Iterative Combinatorial Auctionscited by 7
  9. 2013The Complexity of Fairness through Equilibriumcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 1; 2025: 1.

3 papers.