The sequential alternative search as a continuous Markov random walk
From MaRDI portal
Publication:2392631
Recommendations
- A stochastically quasi-optimal search algorithm for the maximum of the simple random walk
- A semi-Markov algorithm for continuous time random walk limit distributions
- Generalized optimal search paths for continuous univariate random variables
- scientific article; zbMATH DE number 4139501
- Optimal sequential search: A Bayesian approach
- Random Walks with Drift – A Sequential Approach
- Efficient search by optimized intermittent random walks
- scientific article; zbMATH DE number 912594
- Optimal Markov monotone symmetric random search
- Maximum-searching semi-Markov processes
Cites work
- scientific article; zbMATH DE number 3711700 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Boundary relations, graphs and collective solutions
- Dominance in SSB utility theory
- Probabilistic choice between alternatives
- SSB preferences: nonseparable utilities or nonseparable beliefs
- Utility maximization, choice and preference
Cited in
(2)
This page was built for publication: The sequential alternative search as a continuous Markov random walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392631)