Optimal Adaptive Policies for Markov Decision Processes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 970511
- A unified approach to adaptive control of average reward Markov decision processes
- Adaptive control of discounted Markov decision chains
- Recursive adaptive control of Markov decision processes with the average reward criterion
- On the adaptive control of a class of partially observed Markov decision processes
Cited in
(42)- A unified approach to adaptive control of average reward Markov decision processes
- On confidence intervals from simulation of finite Markov chains
- Optimal adaptive policies for sequential allocation problems
- On bidding for a fixed number of items in a sequence of auctions
- Adaptive policies for stochastic systems under a randomized discounted cost criterion
- Robust control of the multi-armed bandit problem
- Dynamic pricing with finite price sets: a non-parametric approach
- Managing mobile production-inventory systems influenced by a modulation process
- Comparison of policy functions from the optimal learning and adaptive control frameworks
- On the evaluation of bidding strategies in sequential auctions
- Infomax strategies for an optimal balance between exploration and exploitation
- scientific article; zbMATH DE number 1804100 (Why is no real title available?)
- Comparing Policies in Markov Decision Processes: Mandl's Lemma Revisited
- Perspectives of approximate dynamic programming
- Dynamic Pricing and Learning with Finite Inventories
- Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
- Kullback-Leibler upper confidence bounds for optimal sequential allocation
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes
- Asymptotically optimal Bayesian sequential change detection and identification rules
- Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes
- Suboptimal Policies, with Bounds, for Parameter Adaptive Decision Processes
- Finding Optimal Survey Policies via Adaptive Markov Decision Processes
- scientific article; zbMATH DE number 1062625 (Why is no real title available?)
- On optimal bidding in sequential procurement auctions
- Normal bandits of unknown means and variances
- On optimal bidding and inventory control in sequential procurement auctions: the multi period case
- Temporal concatenation for Markov decision processes
- Dynamic Inventory and Price Controls Involving Unknown Demand on Discrete Nonperishable Items
- Optimal online learning for nonlinear belief models using discrete priors
- Adaptive policies for sequential sampling under incomplete information and a cost constraint
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Multi-armed bandits under general depreciation and commitment
- Asymptotically optimal multi-armed bandit policies under a cost constraint
- scientific article; zbMATH DE number 970511 (Why is no real title available?)
- Bayesian sequential optimal experimental design for nonlinear models using policy gradient reinforcement learning
- Convergence rate analysis for optimal computing budget allocation algorithms
- Logarithmic regret bounds for continuous-time average-reward Markov decision processes
- Data-driven rules for multidimensional reflection problems
- Complexity bounds for deterministic partially observed Markov decision processes
- Boundary crossing probabilities for general exponential families
- A perpetual search for talents across overlapping generations: a learning process
- Online regret bounds for Markov decision processes with deterministic transitions
This page was built for publication: Optimal Adaptive Policies for Markov Decision Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339383)