Optimal learning with costly adjustment
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3122709 (Why is no real title available?)
- scientific article; zbMATH DE number 4060392 (Why is no real title available?)
- scientific article; zbMATH DE number 42272 (Why is no real title available?)
- scientific article; zbMATH DE number 193660 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- scientific article; zbMATH DE number 3357742 (Why is no real title available?)
- scientific article; zbMATH DE number 3394474 (Why is no real title available?)
- Bayesian dynamic programming
- Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal
- Controlling a Stochastic Process with Unknown Parameters
- Denumerable-Armed Bandits
- Discounted Dynamic Programming
- On dynamic programming: Compactness of the space of policies
- On the generic nonconvergence of Bayesian actions and beliefs
- Optimal Control of an Unknown Linear Process with Learning
- Optimal Learning by Experimentation
- Optimal learning with costly adjustment
- Switching Costs and the Gittins Index
Cited in
(8)- Optimal investment in learning-curve technologies
- Linear learning in changing environments
- Generalized Bandit Problems
- Optimal search with learning
- Learning and control in a changing economic environment.
- Optimal learning with costly adjustment
- Adjustment costs from environmental change
- Switching cost models as hypothesis tests
This page was built for publication: Optimal learning with costly adjustment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904629)