Robust sequential search

DOI10.3982/TE3994MaRDI QIDQ3390547zbMATH OpenOpenAlexFDO

Authors Karl H. Schlag, Andriy Zapechelnyuk

Publication date 24 March 2022

Published in Theoretical Economics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.3982/te3994

zbMATH Keywords

competitive ratiorobustness, dynamic consistencysearch without priorssequential search

Mathematics Subject Classification ID

Search theory (90B40) Decision theory (91B06)

Recommendations

• Optimal search with learning
• Optimal Search
• Sequential search beats best-of-N search
• Sequential search with adaptive intensity
• Optimal search from multiple distributions with infinite horizon

Cited in

(8)

• Branching bandits: A sequential search process with correlated pay-offs.
• Optimal search from multiple distributions with infinite horizon
• Sequential search with a budget constraint
• scientific article; zbMATH DE number 2079406 (Why is no real title available?)
• Sequential search beats best-of-N search
• Sequential search with adaptive intensity
• Bidding in multi-unit auctions under limited information
• Persuasion without priors

This page was built for publication: Robust sequential search

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