Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
From MaRDI portal
Publication:5470783
DOI10.1137/S0895480104440596zbMath1097.60025OpenAlexW2014543842MaRDI QIDQ5470783
Michał Morayne, Grzegorz M. Kubicki
Publication date: 1 June 2006
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480104440596
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (11)
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 ⋮ An efficient algorithm for stopping on a sink in a directed graph ⋮ Maximizing the expected number of components in an online search of a graph ⋮ Percolation and best-choice problem for powers of paths ⋮ Optimal stopping in a search for a vertex with full degree in a random graph ⋮ 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 ⋮ Secretary problem with hidden information; searching for a high merit candidate
This page was built for publication: Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
