Lectures related to Common-law marriage

The Marriage Problem

Explores the marriage problem, where a bride must strategically accept suitors to maximize her chances of selecting the best one.

The Marriage Problem

Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.

Greedy Change-Making Algorithm: Optimality and Stability

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Marriage Problem: Gale Shapley Algorithm

Covers the Marriage Problem and the Gale Shapley Algorithm to find stable matches.

Algorithms: Stable Matchings

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Algorithms: Stable Matchings

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.