Pages that link to "Item:Q1922542"

The following pages link to Optimal adaptive policies for sequential allocation problems (Q1922542):

Displaying 29 items.

• Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
• Kullback-Leibler upper confidence bounds for optimal sequential allocation (Q366995) (← links)
• Adaptive aggregation for reinforcement learning in average reward Markov decision processes (Q378753) (← links)
• Robustness of stochastic bandit policies (Q391739) (← links)
• An asymptotically optimal policy for finite support models in the multiarmed bandit problem (Q415624) (← links)
• Irreversible adaptive allocation rules (Q581980) (← links)
• A non-parametric solution to the multi-armed bandit problem with covariates (Q826996) (← links)
• A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
• On bidding for a fixed number of items in a sequence of auctions (Q1926913) (← links)
• Robust control of the multi-armed bandit problem (Q2095215) (← links)
• The multi-armed bandit problem: an efficient nonparametric solution (Q2176624) (← links)
• Adaptive policies for perimeter surveillance problems (Q2286935) (← links)
• Asymptotically optimal algorithms for budgeted multiple play bandits (Q2331676) (← links)
• Consistency of Sequential Bayesian Sampling Policies (Q3021270) (← links)
• Optimal sequential sampling from two populations. (Q3317934) (← links)
• (Q4518923) (← links)
• (Q4558161) (← links)
• (Q4558474) (← links)
• Learning the distribution with largest mean: two bandit frameworks (Q4606431) (← links)
• Structured Policies for a Sequential Design Problem with General Distributions (Q4726073) (← links)
• EXPLORATION–EXPLOITATION POLICIES WITH ALMOST SURE, ARBITRARILY SLOW GROWING ASYMPTOTIC REGRET (Q5070864) (← links)
• Infinite Arms Bandit: Optimality via Confidence Bounds (Q5089465) (← links)
• Sequential Bayes-Optimal Policies for Multiple Comparisons with a Known Standard (Q5166273) (← links)
• Explore First, Exploit Next: The True Shape of Regret in Bandit Problems (Q5219722) (← links)
• Adaptive Policies for Sequential Sampling under Incomplete Information and a Cost Constraint (Q5261007) (← links)
• MULTI-ARMED BANDITS UNDER GENERAL DEPRECIATION AND COMMITMENT (Q5358026) (← links)
• ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT (Q5358116) (← links)
• Tracking the mean of a piecewise stationary sequence (Q6623990) (← links)
• Pair-matching: link prediction with adaptive queries (Q6652703) (← links)