scientific article
From MaRDI portal
Publication:4012000
zbMATH Open0757.62040MaRDI QIDQ4012000FDOQ4012000
Publication date: 27 September 1992
Title of this publication is not available (Why is that?)
Recommendations
partial ordersecretary problemchoice functionPareto-optimalexpected lossnear optimalclasses of selection strategiesmultidimensional variantsparametric class of strategiesrank problemssequential selection models
Statistical ranking and selection procedures (62F07) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Cited In (15)
- The best choice problem for a union of two linear orders with common maximum
- Counting embeddings of a chain into a tree
- From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
- The best choice problem for posets; colored complete binary trees
- Percolation and best-choice problem for powers of paths
- A best-choice problem with multiple selectors
- The best choice problem for upward directed graphs
- Constructing a strict total order for alternatives characterized by multiple criteria: An extension
- Optimal stopping in a search for a vertex with full degree in a random graph
- Gusein-Zade problem for directed path
- The best-choice problem for partially ordered objects.
- Title not available (Why is that?)
- Counting embeddings of rooted trees into families of rooted trees
- Optimal stopping for many connected components in a graph
- Title not available (Why is that?)
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)