Minimax solutions for the best choice problem with random freeze times and a random number of options

This article provides minimax solutions of certain best choice problems in which applicants may not be appointed after some random (freeze) time. It is nice to see that the so-called Unified Approach for best choice problems can be extended to include this modification, and that this extension leads to a considerable simplification compared with the dynamic programming approach. Moreover, this extension includes the feature of a random number of applicants, and also allows for certain interdependencies between the intensity of the stream of applicants and the risk of freeze, which both add to the applicational appeal of such models.