Title: Optimal Stopping and the Odds Algorithm

Speaker: Brandon McPhail

Abstract:

The secretary problem, or marriage problem, is a classic problem where a sequence of objects are presented in an online fashion, and a strategy must be devised for choosing the best object before all the objects have been seen.  In this talk, I will present the original secretary problem and an optimal algorithm by Thomas Bruss to this and other such "optimal stopping" problems.