Parallel search for the best alternative

DOI10.1007/BF01212473MaRDI QIDQ1338097zbMATH OpenFDO

Authors Tara Vishwanath

Publication date 27 November 1994

Published in Economic Theory (Search for Journal in Brave)

zbMATH Keywords

parallel search

Mathematics Subject Classification ID

Dynamic programming (90C39) Mathematical economics (91B99) Economics of information (91B44)

Recommendations

• Optimal Search
• Optimal search with learning
• Sequential search beats best-of-\(N\) search
• Parallel search for information in continuous time -- optimal stopping and geometry of the PDE
• Optimal Orderings for Parallel Project Selection

Cites work

• scientific article; zbMATH DE number 3687126 (Why is no real title available?)
• scientific article; zbMATH DE number 3638998 (Why is no real title available?)
• Declining Reservation Wages and Learning
• Equilibrium Comparison Shopping
• Funding Criteria for Research, Development, and Exploration Projects
• Labor market equilibrium under nonsequential search
• Optimal Search for the Best Alternative
• Search and Optimal Sample Sizes

Cited in

(11)

• Optimal Orderings for Parallel Project Selection
• Whether or not to open Pandora's box
• Increasing threshold search for best-valued agents
• Learning while searching for the best alternative
• Parallel search for information in continuous time -- optimal stopping and geometry of the PDE
• Managing parallel inquiries in agents' two-sided search
• Sequential search beats best-of-\(N\) search
• Auctions with costly information acquisition
• Search Before Trade-offs Are Known
• Branching bandits: A sequential search process with correlated pay-offs.
• Optimal search auctions

This page was built for publication: Parallel search for the best alternative

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