Partial-order analogue of the secretary problem: The binary tree case
type: Item
instance of: scholarly article
title: Partial-order analogue of the secretary problem: The binary tree case
zbMATH Open document ID: 0958.60041
DOI: 10.1016/S0012-365X(97)00091-5
author: Michał Morayne
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 60G40
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 1524809
zbMATH Keywords: secretary problem
zbMATH Keywords: optimal stopping
zbMATH Keywords: binary tree
MaRDI profile type: Publication
cites work: Optimal selection based on relative rank (the 'Secretary Problem')
cites work: Q5641856
cites work: Who solved the secretary problem
cites work: A secretary problem with uncertain employment
cites work: Q3859034
cites work: Recognizing the maximum of a random sequence based on relative rank with backward solicitation
Recommended article: A Ratio Inequality for Binary Trees and the Best Secretary
Recommended article: Optimal binary trees with order constraints
Recommended article: The Secretary Problem and Its Extensions: A Review
Recommended article: On the complexity of searching in trees and partially ordered structures
Recommended article: Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
Recommended article: Strong Algorithms for the Ordinal Matroid Secretary Problem
Recommended article: Q4607929
Recommended article: Improved algorithms and analysis for secretary problems and generalizations
description: scientific article; zbMATH DE number 1524809