Multi‐Armed Bandit Allocation Indices

No abstract is available for this paper.

• Publication year

  1990

• Venue

  Journal of The Royal Statistical Society Series A-statistics in Society

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Economics

• Identifiers
  DOI 10.2307/2982809
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• Uncertainty-of-Information Scheduling: A Restless Multiarmed Bandit Framework

  2021cites this paper
• Locks, Bombs and Testing: The Case of Independent Locks

  2021cites this paper
• Whittle Index Policy for Opportunistic Scheduling: Heterogeneous Two-State Channels

  2021cites this paper
• An online algorithm for the risk-aware restless bandit

  2021cites this paper
• SmartDL: energy-aware decremental learning in a mobile-based federation for geo-spatial system

  2021cites this paper
• Improved differential evolution based on multi-armed bandit for multimodal optimization problems

  2021cites this paper
• TSEC: A Framework for Online Experimentation under Experimental Constraints

  2021cites this paper
• Index-based update policy for minimizing information mismatch with Markovian sources

  2021cites this paper
• Reinforcement Learning: An Industrial Perspective

  2021cites this paper
• Strategic Experimentation with Congestion

  2021cites this paper
• Role of Donors in Global Health Supply Chains

  2021cites this paper
• Models for selecting an effective order fulfilment

  2021cites this paper
• The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions

  2020cites this paper
• Advances in the computational understanding of mental illness

  2020cites this paper
• A novel statistical test for treatment differences in clinical trials using a response-adaptive forward-looking Gittins Index Rule

  2020cites this paper
• Including Learning Analytics in the Loop of Self-Paced Online Course Learning Design

  2020cites this paper
• Multi-machine preventive maintenance scheduling with imperfect interventions: A restless bandit approach

  2020cites this paper
• A learnheuristic approach for the team orienteering problem with aerial drone motion constraints

  2020cites this paper
• Flow Sampling: Accurate and Load-balanced Sampling Policies

  2020cites this paper
• A Restless MAB-Based Index Policy for UL Pilot Allocation in Massive MIMO Over Gauss–Markov Fading Channels

  2020cites this paper
• Differentiable Bandit Exploration

  2020cites this paper
• Age-of-Information Bandits

  2020cites this paper
• Finding appropriate settings for fairness and engagement in a newly designed game through self-playing AI program: A case study using Japanese crossword game 'MyoGo Renju'

  2020cites this paper
• Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic

  2020influential citation
• Site-Specific Online Compressive Beam Codebook Learning in mmWave Vehicular Communication

  2020influential citation
• Whittle index based Q-learning for restless bandits with average reward

  2020cites this paper
• Asymptotically optimal delay-aware scheduling in queueing systems

  2020cites this paper
• Exponential Convergence Rate for the Asymptotic Optimality of Whittle Index Policy

  2020cites this paper
• Adaptive Discretization for Adversarial Bandits with Continuous Action Spaces

  2020cites this paper
• Book announcement: Introduction to Multi-Armed Bandits

  2020cites this paper
• Flow Sampling: Network Monitoring in Large-Scale Software-Defined IoT Networks

  2020cites this paper
• The Price of Incentivizing Exploration: A Characterization via Thompson Sampling and Sample Complexity

  2020cites this paper
• Sample Complexity of Incentivized Exploration

  2020cites this paper
• Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback

  2020cites this paper
• Task Offloading for Large-Scale Asynchronous Mobile Edge Computing: An Index Policy Approach

  2020cites this paper
• Sublinear Regret and Belief Complexity in Gaussian Process Bandits via Information Thresholding.

  2020cites this paper
• Untrusted Predictions Improve Trustable Query Policies

  2020cites this paper
• Aging Bandits: Regret Analysis and Order-Optimal Learning Algorithm for Wireless Networks with Stochastic Arrivals

  2020cites this paper
• On the computation of Whittle’s index for Markovian restless bandits

  2020cites this paper
• Conditions for indexability of restless bandits and an $\mathcal{O}\!\left(K^3\right)$ algorithm to compute Whittle index

  2020cites this paper
• An optimal selection for ensembles of influential projects

  2020cites this paper
• The breadth-depth dilemma in a finite capacity model of decision-making

  2020cites this paper
• Elastic multi-connectivity in 5G networks

  2020cites this paper
• On competitive analysis for polling systems

  2020cites this paper
• On State Variables, Bandit Problems and POMDPs

  2020cites this paper
• Index Policies and Performance Bounds for Dynamic Selection Problems

  2020cites this paper
• Multi-armed bandits with dependent arms

  2020cites this paper
• Screening for an Infectious Disease as a Problem in Stochastic Control

  2020influential citation
• Restless bandits: indexability and computation of Whittle index

  2020cites this paper
• Efficient Gaussian Process Bandits by Believing only Informative Actions

  2020cites this paper
• Contextual Bayesian optimization with trust region (CBOTR) and its application to cooperative wind farm control in region 2

  2020cites this paper
• Optimal Learning for Sequential Decisions in Laboratory Experimentation

  2020cites this paper
• Simulation Based Algorithms for Markov Decision Processes and Multi-Action Restless Bandits

  2020cites this paper
• Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks With Random Updates

  2020cites this paper
• On the dynamic allocation of assets subject to failure

  2020cites this paper
• Active Learning for Skewed Data Sets

  2020cites this paper
• Scalability in Computing and Robotics

  2020cites this paper
• Regret Analysis of a Markov Policy Gradient Algorithm for Multi-arm Bandits

  2020cites this paper
• Learning path personalization and recommendation methods: A survey of the state-of-the-art

  2020cites this paper
• Regret of Age-of-Information Bandits

  2020cites this paper
• Optimizing Information Freshness via Multiuser Scheduling With Adaptive NOMA/OMA

  2020cites this paper
• Age of Information: An Introduction and Survey

  2020cites this paper
• A Partially Observable MDP Approach for Sequential Testing for Infectious Diseases such as COVID-19

  2020cites this paper
• Bandit Change-Point Detection for Real-Time Monitoring High-Dimensional Data Under Sampling Control

  2020cites this paper
• An Index-based Deterministic Asymptotically Optimal Algorithm for Constrained Multi-armed Bandit Problems

  2020cites this paper
• Heuristics and optimal solutions to the breadth–depth dilemma

  2020cites this paper
• Partially Observable Minimum-Age Scheduling: The Greedy Policy

  2020influential citation
• Scalable Delay-Sensitive Polling of Sensors

  2020cites this paper
• Bayesian Meta-Prior Learning Using Empirical Bayes

  2020cites this paper
• Necessary and Sufficient Conditions for Inverse Reinforcement Learning of Bayesian Stopping Time Problems

  2020cites this paper
• Learning to Detect an Odd Markov Arm

  2019cites this paper
• Recommending Products When Consumers Learn Their Preference Weights

  2019cites this paper
• Dynamic Online Pricing with Incomplete Information Using Multiarmed Bandit Experiments

  2019cites this paper
• On index policies for stochastic minsum scheduling

  2019cites this paper
• Continuous-Time Birth-Death MCMC for Bayesian Regression Tree Models

  2019cites this paper
• Generative Adversarial Networks are special cases of Artificial Curiosity (1990) and also closely related to Predictability Minimization (1991)

  2019cites this paper
• Optimal Search and Discovery

  2019cites this paper
• Bandit-based cooperative coevolution for tackling contribution imbalance in large-scale optimization problems

  2019cites this paper
• Introduction to Multi-Armed Bandits

  2019cites this paper
• A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents

  2019cites this paper
• Load Balancing Guardrails

  2019cites this paper
• Achieving Near-Optimal Fairness in Energy Harvesting Wireless Sensor Networks

  2019cites this paper
• A unified framework for stochastic optimization

  2019cites this paper
• Selecting multiple web adverts: A contextual multi-armed bandit with state uncertainty

  2019cites this paper
• Computation Task Assignment in Vehicular Fog Computing: A Learning Approach via Neighbor Advice

  2019cites this paper
• Predictive and prescriptive methods in operations research and machine learning : an optimization approach

  2019cites this paper
• A practical approach to sample size calculation for fixed populations

  2019cites this paper
• Deep Autoencoders with Value-at-Risk Thresholding for Unsupervised Anomaly Detection

  2019cites this paper
• Uncertainty in learning, choice, and visual fixation

  2019cites this paper
• On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization

  2019cites this paper
• Smoothness-Adaptive Stochastic Bandits

  2019influential citation
• Optimal learning before choice

  2019cites this paper
• Interactive Recommendation with User-Specific Deep Reinforcement Learning

  2019cites this paper
• Robo-advising: Learning Investors' Risk Preferences via Portfolio Choices

  2019cites this paper
• Scheduling in Wireless Networks with Spatial Reuse of Spectrum as Restless Bandits

  2019cites this paper
• The Markovian Price of Information

  2019cites this paper
• Longitudinal planning for personalized health management using daily behavioral data

  2019cites this paper
• On Optimal Ordering in the Optimal Stopping Problem

  2019cites this paper
• Exploiting Fast Decaying and Locality in Multi-Agent MDP with Tree Dependence Structure

  2019cites this paper
• Reinforcement Learning: a Comparison of UCB Versus Alternative Adaptive Policies

  2019cites this paper