Optimization-based mechanisms for the course allocation problem
From MaRDI portal
Publication:3386789
DOI10.1287/IJOC.2018.0849zbMATH Open1451.90093OpenAlexW2999993211MaRDI QIDQ3386789FDOQ3386789
Authors:
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0849
Recommendations
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- A tale of two mechanisms: Student placement
- The object allocation problem with random priorities
- Efficient Resource Allocation on the Basis of Priorities
Cites Work
Cited In (9)
- A direct barter model for course add/drop process
- Matching with indifferences: a comparison of algorithms in the context of course allocation
- An incentive dynamic programming method for the optimization of scholarship assignment
- An integer programming model for assigning students to elective courses
- Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
- Optimal block design models for course timetabling
- Optimum allocation of places to students in a national university system
- Goal programming approach for course affiliation problem
- Mathematical programming models and algorithms for a class--faculty assignment problem
This page was built for publication: Optimization-based mechanisms for the course allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386789)