Switching strategies to optimize search

DOI10.1088/1742-5468/2016/03/033402zbMATH Open1456.91035OpenAlexW2325126008MaRDI QIDQ3302575FDOQ3302575

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

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Theory of optimal search
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Random searching
• Search strategy: Hedging your bet
• The random search problem: trends and perspectives

Cited In (4)

• Search strategy: Hedging your bet
• Introduction: Unsolved Problems on Noise
• Optimal search with positive switch cost is NP-hard
• 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)