Explores the marriage problem, where a bride must strategically accept suitors to maximize her chances of selecting the best one.
Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.
Explores the computation of mean field and effective field in message passing algorithms.
Covers exercises on the spin model, independent set, matching, and increasing functions.
Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.
Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.
