Partial-order analogue of the secretary problem the binary tree case Original Research Article

We find an optimal stopping time for the partial-order analogue of the secretary problem in the case of the full binary tree of finite length.