Pages that link to "Item:Q3083924"

The following pages link to Multi‐Armed Bandit Allocation Indices (Q3083924):

Displaying 49 items.

• Bayesian Exploration for Approximate Dynamic Programming (Q4971589) (← links)
• Competing bandits: learning under competition (Q4993317) (← links)
• Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents (Q4994155) (← links)
• Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (Q4994160) (← links)
• Matching While Learning (Q4994180) (← links)
• (Q4998863) (← links)
• A General Theory of MultiArmed Bandit Processes with Constrained Arm Switches (Q5020738) (← links)
• A Restless Bandit Model for Resource Allocation, Competition, and Reservation (Q5031019) (← links)
• Bayesian adaptive bandit-based designs using the Gittins index for multi-armed trials with normally distributed endpoints (Q5035752) (← links)
• Conditions for indexability of restless bandits and an algorithm to compute Whittle index (Q5055364) (← links)
• Bayesian Exploration: Incentivizing Exploration in Bayesian Games (Q5080666) (← links)
• Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain Payoffs (Q5080672) (← links)
• On Submodular Search and Machine Scheduling (Q5108249) (← links)
• Open Problem—M/G/1 Scheduling with Preemption Delays (Q5113909) (← links)
• (Q5131476) (← links)
• A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model (Q5137960) (← links)
• Adaptive Matching for Expert Systems with Uncertain Task Types (Q5144772) (← links)
• Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors (Q5144779) (← links)
• Algorithms for recursive delegation (Q5145458) (← links)
• (Q5148993) (← links)
• Locks, Bombs and Testing: The Case of Independent Locks (Q5153611) (← links)
• Complete expected improvement converges to an optimal budget allocation (Q5203897) (← links)
• An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits (Q5203955) (← links)
• Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability (Q5219548) (← links)
• Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671) (← links)
• Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting (Q5240313) (← links)
• Open Bandit Processes with Uncountable States and Time-Backward Effects (Q5299564) (← links)
• MULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENT (Q5358026) (← links)
• ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS (Q5358114) (← links)
• ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
• Uncertainty in learning, choice, and visual fixation (Q5854809) (← links)
• Optimal activation of halting multi‐armed bandit models (Q6057028) (← links)
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)
• A novel statistical test for treatment differences in clinical trials using a response‐adaptive forward‐looking Gittins Index Rule (Q6079846) (← links)
• Topp-Leone distribution with an application to binomial sampling (Q6082977) (← links)
• A foreground-background queueing model with speed or capacity modulation (Q6135889) (← links)
• Exponential asymptotic optimality of Whittle index policy (Q6164144) (← links)
• Empirical Gittins index strategies with \(\varepsilon\)-explorations for multi-armed bandit problems (Q6167036) (← links)
• Consumer strategy, vendor strategy and equilibrium in duopoly markets with production costs (Q6177268) (← links)
• A confirmation of a conjecture on Feldman’s two-armed bandit problem (Q6198964) (← links)
• Differentially private reinforcement learning (Q6536233) (← links)
• Adversarial bandits with knapsacks (Q6551256) (← links)
• Optimal pure strategies for a discrete search game (Q6555162) (← links)
• A Bayesian two-armed bandit model (Q6574583) (← links)
• Low-complexity algorithm for restless bandits with imperfect observations (Q6629533) (← links)
• TSEC: A Framework for Online Experimentation under Experimental Constraints (Q6631092) (← links)
• Bandit Change-Point Detection for Real-Time Monitoring High-Dimensional Data Under Sampling Control (Q6631108) (← links)
• Factorial Designs for Online Experiments (Q6631856) (← links)