Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of the marriage problem, where a bride must decide to accept or reject a series of suitors in order to maximize her chances of selecting the best one. The optimal policy involves accepting the first 36.8% of suitors and then choosing the best one after that. The lecture delves into dynamic programming algorithms and controlled stochastic processes to find the optimal strategy.