Switching strategies to optimize search

DOI10.1088/1742-5468/2016/03/033402MaRDI QIDQ3302575zbMATH OpenOpenAlexFDO

Authors Michael F. Shlesinger

Publication date 11 August 2020

Published in Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1742-5468/2016/03/033402

Mathematics Subject Classification ID

Search theory (90B40) Probabilistic games; gambling (91A60)

Recommendations

• Search strategy: hedging your bet
• An elementary approach to optimal discrete-time search strategies
• Random searching
• scientific article; zbMATH DE number 3910122
• Optimal intermittent search strategies

Cites work

• Title not available (Why is no real title available?)
• scientific article; zbMATH DE number 5949328 (Why is no real title available?)
• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 3068104 (Why is no real title available?)
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Random searching
• The random search problem: trends and perspectives
• Theory of optimal search

Cited in

(5)

• Introduction: unsolved problems on noise
• Sequential search beats a two-parameter search
• Optimal search with positive switch cost is NP-hard
• Search strategy: hedging your bet
• Switcher random walkers: cognitive inspired strategies for an optimized random exploration of networks

This page was built for publication: Switching strategies to optimize search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3302575)