Optimal Search for the Best Alternative
From MaRDI portal
Cited in
(99)- Auctions with costly information acquisition
- Political decision making with costly and imperfect information
- Optimal sequential sampling policy of partitioned random search and its approximation
- A latent structure double hurdle regression model for exploring heterogeneity in consumer search patterns.
- Optimal sequential file search
- Parallel search for the best alternative
- Learning by observation within the firm
- Branching bandits: A sequential search process with correlated pay-offs.
- Competitive search obfuscation
- Ordered search with asymmetric product design
- Optimal dynamic resource allocation to prevent defaults
- Optimal learning before choice
- Whether or not to open Pandora's box
- A note on optimal experimentation under risk aversion
- Optimal search from multiple distributions with infinite horizon
- Optimal stopping under ambiguity in continuous time
- Consumer search with blind buying
- Search with multiple attributes: theory and empirics
- Joint search with self-interested agents and the failure of cooperation enhancers
- Prominence of store-brand products in an electronic platform
- Explorable uncertainty in scheduling with non-uniform testing times
- Robust experimentation in the continuous time bandit problem
- Sequential search with partial depth
- An adversarial model for scheduling with testing
- Market segmentation in online platforms
- A geometric framework for modeling dynamic decisions among arbitrarily many alternatives
- Optimal stopping problems in Lévy models with random observations
- Attributes
- Optimal search auctions
- Nonparametric learning rules from bandit experiments: the eyes have it!
- Sequential negotiations with costly information acquisition
- Increasing threshold search for best-valued agents
- Consumer search markets with costly revisits
- Consumer search with asymmetric price sampling
- Expert-mediated sequential search
- `Divide-and-choose' in list-based decision problems
- Project planning with alternative technologies in uncertain environments
- Prophet inequality with competing agents
- Strategic experimentation with random serial dictatorship
- Legislative informational lobbying
- Insufficient entry and consumer search
- Multi-task research and research joint ventures
- A bisection/successive approximation method for computing Gittins indices
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy
- Search Before Trade-offs Are Known
- Optimal Stopping Problem with Controlled Recall
- A PTAS for a class of stochastic dynamic programs
- Online allocation and pricing: constant regret via Bellman inequalities
- Delegated concept testing in new product development
- Procurement Mechanisms with Post-Auction Pre-Award Cost-Reduction Investigations
- ROC++: Robust Optimization in C++
- Approximations to stochastic dynamic programs via information relaxation duality
- Consumer choice under limited attention when alternatives have different information costs
- Pricing and assortment strategies with product exchanges
- Learning the Krepsian state: exploration through consumption
- Two-armed restless bandits with imperfect information: stochastic control and indexability
- Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting
- Generalized Bandit Problems
- Residential mobility, neighborhood effects, and educational attainment of blacks and whites
- Learning while searching for the best alternative
- Stationary multi-choice bandit problems.
- Information design for selling search goods and the effect of competition
- Competitive information disclosure in random search markets
- Investment strategies of information‐provision technology in the platform‐based supply chain
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
- Modeling eye movements during decision making: a review
- Optimal Dynamic Information Acquisition
- Stochastic Probing with Increasing Precision
- School choice with costly information acquisition
- Optimal voting rules for two-member tenure committees
- Pandora Box problem with nonobligatory inspection: hardness and approximation scheme
- Pandora's problem with nonobligatory inspection: optimal structure and a PTAS
- Delegating trial and error
- The power of amortization on scheduling with explorable uncertainty
- High-welfare matching markets via descending price
- Prominence and market power: asymmetric oligopoly with sequential consumer search
- Search With Learning for Differentiated Products: Evidence from E-Commerce
- Nonparametric Estimation of Search Costs for Differentiated Products: Evidence from Medigap
- Coordination with sequential information acquisition
- Competitive price discrimination, imperfect information, and consumer search
- You can lead a horse to water: spatial learning and path dependence in consumer search
- Pandora's box problem with time constraints
- Do search costs explain persistent investment in active mutual funds?
- Forward-looking experimentation of correlated alternatives
- Optimal policing with (and without) criminal search
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Delegated stochastic probing
- Maximising the weighted number of activity execution modes in project planning
- Random order vertex arrival contention resolution schemes for matching, with applications
- Matching with nested and bundled Pandora boxes
- Pandora's box problem over time
- Designing exploration contracts
- Household stock portfolios under sequential search: implications for diversification puzzle and household risk
- Nash equilibrium search for the best alternative
- Scheduling with testing on multiple identical parallel machines
- A more general Pandora rule?
- A perpetual search for talents across overlapping generations: a learning process
- Migration under uncertainty about quality of locations
- Resource allocation when projects have ranges of increasing returns
This page was built for publication: Optimal Search for the Best Alternative
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863649)
