Optimal Search for the Best Alternative
From MaRDI portal
Publication:3863649
DOI10.2307/1910412zbMath0426.90017OpenAlexW2136127899MaRDI QIDQ3863649
Publication date: 1979
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/31303
Related Items (77)
Optimal sequential file search ⋮ A bisection/successive approximation method for computing Gittins indices ⋮ Scheduling with testing on multiple identical parallel machines ⋮ Parallel search for the best alternative ⋮ Competitive search obfuscation ⋮ Optimal search auctions ⋮ `Divide-and-choose' in list-based decision problems ⋮ Project planning with alternative technologies in uncertain environments ⋮ Delegated Concept Testing in New Product Development ⋮ Learning by observation within the firm ⋮ Procurement Mechanisms with Post-Auction Pre-Award Cost-Reduction Investigations ⋮ ROC++: Robust Optimization in C++ ⋮ Robust experimentation in the continuous time bandit problem ⋮ Ordered search with asymmetric product design ⋮ Sequential search with partial depth ⋮ Political decision making with costly and imperfect information ⋮ Prophet inequality with competing agents ⋮ Strategic experimentation with random serial dictatorship ⋮ A more general Pandora rule? ⋮ Information design for selling search goods and the effect of competition ⋮ Optimal voting rules for two-member tenure committees ⋮ Competitive information disclosure in random search markets ⋮ Optimal stopping under ambiguity in continuous time ⋮ Investment strategies of information‐provision technology in the platform‐based supply chain ⋮ A perpetual search for talents across overlapping generations: a learning process ⋮ Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents ⋮ Optimal dynamic resource allocation to prevent defaults ⋮ Legislative informational lobbying ⋮ Algorithms and mechanisms for procuring services with uncertain durations using redundancy ⋮ Unnamed Item ⋮ Modeling eye movements during decision making: a review ⋮ Optimal Dynamic Information Acquisition ⋮ Stochastic Probing with Increasing Precision ⋮ School choice with costly information acquisition ⋮ Insufficient entry and consumer search ⋮ Nonparametric learning rules from bandit experiments: the eyes have it! ⋮ Sequential negotiations with costly information acquisition ⋮ An adversarial model for scheduling with testing ⋮ Migration under uncertainty about quality of locations ⋮ Approximations to Stochastic Dynamic Programs via Information Relaxation Duality ⋮ Consumer Choice Under Limited Attention When Alternatives Have Different Information Costs ⋮ Branching bandits: A sequential search process with correlated pay-offs. ⋮ Pricing and Assortment Strategies with Product Exchanges ⋮ Increasing threshold search for best-valued agents ⋮ Consumer search markets with costly revisits ⋮ Optimal learning before choice ⋮ Resource allocation when projects have ranges of increasing returns ⋮ Market segmentation in online platforms ⋮ Learning the Krepsian state: exploration through consumption ⋮ Consumer search with blind buying ⋮ Whether or not to open Pandora's box ⋮ A note on optimal experimentation under risk aversion ⋮ Search with multiple attributes: theory and empirics ⋮ Joint search with self-interested agents and the failure of cooperation enhancers ⋮ Learning while searching for the best alternative ⋮ Maximising the weighted number of activity execution modes in project planning ⋮ Optimal search from multiple distributions with infinite horizon ⋮ Stationary multi-choice bandit problems. ⋮ Optimal Stopping Problem with Controlled Recall ⋮ Search Before Trade-offs Are Known ⋮ Consumer search with asymmetric price sampling ⋮ Expert-mediated sequential search ⋮ Auctions with costly information acquisition ⋮ Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability ⋮ Optimal sequential sampling policy of partitioned random search and its approximation ⋮ Prominence of store-brand products in an electronic platform ⋮ Generalized Bandit Problems ⋮ Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting ⋮ Nash equilibrium search for the best alternative ⋮ A geometric framework for modeling dynamic decisions among arbitrarily many alternatives ⋮ Online Allocation and Pricing: Constant Regret via Bellman Inequalities ⋮ Optimal stopping problems in Lévy models with random observations ⋮ A latent structure double hurdle regression model for exploring heterogeneity in consumer search patterns. ⋮ Residential Mobility, Neighborhood Effects, and Educational Attainment of Blacks and Whites ⋮ Attributes ⋮ Multi-task Research and Research Joint Ventures ⋮ Explorable uncertainty in scheduling with non-uniform testing times
This page was built for publication: Optimal Search for the Best Alternative
