scientific article
From MaRDI portal
Publication:3921912
zbMath0468.60046MaRDI QIDQ3921912
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
utility functionsecretary problemoptimal stopping rulesstopping time which maximizes the probability of choosing the best object
Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Related Items (14)
On a class of best-choice problems ⋮ An optimal algorithm for stopping on the element closest to the center of an interval ⋮ The best choice problem for upward directed graphs ⋮ 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 ⋮ The best choice problem for posets; colored complete binary trees ⋮ A Secretary Problem with Many Lives ⋮ 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:
