This is also known as the Marriage Problem. Simply stated, the problem is what is the best strategy to find the best choice among a large set of alternatives in a snap decision. It is said, and in ...

Only recently, progress has been made in obtaining o(log (rank))-competitive algorithms for the matroid secretary problem. More precisely, Chakraborty and Lachish ...

The theorem assumes a goal that's not very sensible. It specifies that hiring the second-best person is just as unacceptable as hiring the worst person. Click to expand... Huh? That is completely the ...