Partial-order analogue of the secretary problem: The binary tree case
From MaRDI portal
Publication:1584204
DOI10.1016/S0012-365X(97)00091-5zbMath0958.60041MaRDI QIDQ1584204
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (20)
Monotone Case for an Extended Process ⋮ An optimal algorithm for stopping on the element closest to the center of an interval ⋮ The best choice problem for upward directed graphs ⋮ Optimal stopping for many connected components in a graph ⋮ Gusein-Zade problem for directed path ⋮ The best choice problem for a union of two linear orders with common maximum ⋮ An efficient algorithm for stopping on a sink in a directed graph ⋮ The best-choice problem for partially ordered objects. ⋮ Maximizing the expected number of components in an online search of a graph ⋮ Embeddings and other mappings of rooted trees into complete trees ⋮ Percolation and best-choice problem for powers of paths ⋮ The best choice problem for posets; colored complete binary trees ⋮ A Secretary Problem with Many Lives ⋮ Secretary problem: graphs, matroids and greedoids ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ Counting embeddings of a chain into a tree ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path ⋮ The secretary problem on an unknown poset ⋮ Secretary problem with hidden information; searching for a high merit candidate
Cites Work
This page was built for publication: Partial-order analogue of the secretary problem: The binary tree case
