Percolation and best-choice problem for powers of paths
From MaRDI portal
Publication:4684858
DOI10.1017/jpr.2017.4zbMath1400.60052OpenAlexW2676169643MaRDI QIDQ4684858
Małgorzata Sulkowska, Fabrício Siqueira Benevides
Publication date: 26 September 2018
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jpr.2017.4
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (5)
An optimal algorithm for stopping on the element closest to the center of an interval ⋮ Optimal stopping for many connected components in a graph ⋮ Maximizing the expected number of components in an online search of a graph ⋮ Counting embeddings of rooted trees into families of rooted trees ⋮ Secretary problem with hidden information; searching for a high merit candidate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially ordered secretaries
- Optimal stopping in a search for a vertex with full degree in a random graph
- Partial-order analogue of the secretary problem: The binary tree case
- Who solved the secretary problem? With comments and a rejoinder by the author
- The best choice problem for upward directed graphs
- Gusein-Zade problem for directed path
- The best-choice problem for partially ordered objects.
- 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 secretary problem on an unknown poset
- How to Choose the Best Twins
- On a universal best choice algorithm for partially ordered sets
- From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
- 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
This page was built for publication: Percolation and best-choice problem for powers of paths
