as a Bipartite Graph Matching Problem where on one side we have candidates and on the other side we have courses. • An allotment is modelled as a binary matrix of courses and TAs. • Updated using MCMC method while minimizing the following objective function. • Optimization objectives / Utility: 1. Student satisfaction 2. Course satisfaction 3. Consistency of TA capability across courses