A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Presents a competitive algorithm for the matroid secretary problem with logarithmic competitive ratio. Teaches online algorithm design and complexity analysis.

Video by Microsoft Research, played through YouTube's embedded player.