✍️ Max Kapur
📜 Master’s student
🏛️ Management Science/Optimization Lab, Seoul National University
Try to decide which colleges to apply to, given
Maximizing the expected maximum of a portfolio of random variables: a challenging combinatorial optimization problem.
Special case: All application fees equal.
applicationorder_heap() are quadratic-time algorithms.
Multiple dispatch, parametric types ⇒ easy to accept different kinds of user input and preserve type stability
Easy to parallelize validation study with
Simplicity of creating and sharing packages
OptimalApplication.jl could be a lot more generic, e.g. accept DataFrames.jl series as input.
Integrate with Bonobo.jl to handle more sophisticated constraint structures that arise in real-world admissions markets.
Graphical interface/web app.
Theory: github.com/maxkapur/CollegeApplication hosts an arXiv paper and various conference slides (including these).