The best choice problem for upward directed graphs

DOI10.1016/j.disopt.2012.04.001zbMath1254.90282OpenAlexW1995704185MaRDI QIDQ1926501

Małgorzata Sulkowska

Publication date: 28 December 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2012.04.001

zbMATH Keywords

directed graphbest choicesecretary problemuniversal algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items

An optimal algorithm for stopping on the element closest to the center of an interval, Optimal stopping for many connected components in a graph, 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, 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially ordered secretaries
• Optimal stopping in a search for a vertex with full degree in a random graph
• Who solved the secretary problem
• Partial-order analogue of the secretary problem: The binary tree case
• Gusein-Zade problem for directed path
• The best-choice problem for partially ordered objects.
• The secretary problem on an unknown poset
• How to Choose the Best Twins
• On a universal best choice algorithm for partially ordered sets
• An Upper Bound for Spherical Caps
• Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
• Dynamic Programming and Decision Theory
• The best choice problem for posets; colored complete binary trees