Nonstationary Bandits with Habituation and Recovery Dynamics
From MaRDI portal
Publication:5144777
DOI10.1287/opre.2019.1918zbMath1455.90095arXiv1707.08423OpenAlexW3040804160MaRDI QIDQ5144777
Yoshimi Fukuoka, Elena Flowers, Anil Aswani, Yonatan Mintz, Philip M. Kaminsky
Publication date: 19 January 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.08423
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized linear models
- Asymptotically efficient adaptive allocation rules
- Statistics with set-valued functions: applications to inverse approximate optimization
- Behavioral modeling in weight loss interventions
- The Complexity of Optimal Queuing Network Control
- Non-Stationary Stochastic Optimization
- The Knowledge Gradient Algorithm for a General Class of Online Learning Problems
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Statistical Learning of Service-Dependent Demand in a Multiperiod Newsvendor Setting
- Approximation algorithms for restless bandit problems
- Information Collection on a Graph
- Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
- The Post-Disaster Debris Clearance Problem Under Incomplete Information
- A Learning Approach for Interactive Marketing to a Customer Segment
- Revenue Management for a Primary-Care Clinic in the Presence of Patient Choice
- Multistate Bayesian Control Chart Over a Finite Horizon
- The Optimal Search for a Moving Target When the Search Path Is Constrained
- Repeated Principal-Agent Games with Discounting
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
- State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms
- Asymptotic Behavior of Optimal Solutions in Stochastic Programming
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Distributed Learning in Multi-Armed Bandit With Multiple Players
- High-Dimensional Statistics
- The Nonstochastic Multiarmed Bandit Problem
- 10.1162/153244303321897690
- OR Forum—A POMDP Approach to Personalize Mammography Screening Decisions
- Optimal M-Switch Surveillance Policies for Liver Cancer in a Hepatitis C–Infected Population
- Inverse Optimization with Noisy Data
- The Big Data Newsvendor: Practical Insights from Machine Learning
- Online Decision Making with High-Dimensional Covariates
- Sequential Bayes-Optimal Policies for Multiple Comparisons with a Known Standard
- Improving Health Outcomes Through Better Capacity Allocation in a Community-Based Chronic Care Model
- Learning to Optimize via Posterior Sampling
- Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access
- An Adaptive Sampling Algorithm for Solving Markov Decision Processes
- Capacity Investment with Demand Learning
- Bayesian Optimization via Simulation with Pairwise Sampling and Correlated Prior Beliefs
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Nonstationary Bandits with Habituation and Recovery Dynamics
