BITS Hostel Allocation Portal

Problem

Hostel allocation is a constrained, high-stakes matching problem. Students have preferences; capacity is fixed; unfair outcomes erode trust quickly.

Approach

I designed and shipped a portal that collected wing preferences in real time and allocated rooms using integer linear programming, dynamic programming, and hierarchical fairness constraints—built to handle concurrent preference submission at campus scale.

Outcome

Deployed for ~950 students, reduced dissatisfaction by about 50%, and handled preference collection with peaks around 805 concurrent users.