The best-choice problem for partially ordered objects.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 446489 (Why is no real title available?)
- scientific article; zbMATH DE number 3734865 (Why is no real title available?)
- scientific article; zbMATH DE number 67292 (Why is no real title available?)
- On a best-choice problem by dependent criteria
- Partial-order analogue of the secretary problem: The binary tree case
- The Secretary Problem and Its Extensions: A Review
Cited in
(26)- On optimal choosing of one of the \(k\) best objects.
- The best choice problem for upward directed graphs
- Gusein-Zade problem for directed path
- Counting embeddings of rooted trees into families of rooted trees
- Secretary problem with hidden information; searching for a high merit candidate
- Maximizing the expected number of components in an online search of a graph
- 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
- Counting embeddings of a chain into a tree
- An optimal algorithm for stopping on the element closest to the center of an interval
- The secretary problem on an unknown poset
- Monotone Case for an Extended Process
- Dynamic threshold strategy for universal best choice problem
- scientific article; zbMATH DE number 3858819 (Why is no real title available?)
- On a universal best choice algorithm for partially ordered sets
- Bruhat orders and the sequential selection of indivisible items
- Percolation and best-choice problem for powers of paths
- From directed path to linear order -- the best choice problem for powers of directed path
- Where should you park your car? The $\frac{1}{2}$ rule
- The choice of several best objects with respect to a partial preference relation
- The best choice problem for posets; colored complete binary trees
- Query-based selection of optimal candidates under the Mallows model
- Optimal stopping for many connected components in a graph
- Partially ordered secretaries
- Analytic insights into an adapted algorithm for the score-based secretary problem
- Optimal stopping in a search for a vertex with full degree in a random graph
This page was built for publication: The best-choice problem for partially ordered objects.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969766)
