scientific article; zbMATH DE number 67292

MaRDI QIDQ4012000zbMATHFDO

Authors Alexander Gnedin

Publication date 27 September 1992

zbMATH Keywords

partial ordersecretary problemchoice functionPareto-optimalexpected lossnear optimalclasses of selection strategiesmultidimensional variantsparametric class of strategiesrank problemssequential selection models

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Recommendations

• scientific article; zbMATH DE number 3928135
• On a best-choice problem by dependent criteria
• On multiple stopping bales
• A best-choice problem with multiple selectors
• scientific article; zbMATH DE number 67291

Cited in

(15)

• Gusein-Zade problem for directed path
• The best choice problem for upward directed graphs
• The best-choice problem for partially ordered objects.
• 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
• scientific article; zbMATH DE number 67291 (Why is no real title available?)
• A best-choice problem with multiple selectors
• The best choice problem for a union of two linear orders with common maximum
• Percolation and best-choice problem for powers of paths
• scientific article; zbMATH DE number 1098939 (Why is no real title available?)
• From directed path to linear order -- the best choice problem for powers of directed path
• Constructing a strict total order for alternatives characterized by multiple criteria: An extension
• Optimal stopping for many connected components in a graph
• The best choice problem for posets; colored complete binary trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012000)