The sequential alternative search as a continuous Markov random walk

DOI10.1134/S0005117911120046zbMATH Open1269.93109OpenAlexW2130100642MaRDI QIDQ2392631FDOQ2392631

Authors: I. A. Zutler 

Publication date: 2 August 2013

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117911120046

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

zbMATH Keywords

Nash equilibriumcomparative utility functioncontinuous Markov random walkestablished probability distributionpossibly intransitivesequential alternative search

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Noncooperative games (91A10) Stochastic systems in control theory (general) (93E03)

Cites Work

• Title not available (Why is that?)
• Boundary relations, graphs and collective solutions
• Utility maximization, choice and preference
• Title not available (Why is that?)
• Dominance in SSB utility theory
• Probabilistic choice between alternatives
• SSB preferences: nonseparable utilities or nonseparable beliefs

Cited In (2)

• Continuous alternation: the complexity of pursuit in continuous domains
• On min-stable horse races with infinitely many horses

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)