Pages that link to "Item:Q3755256"

The following pages link to The Multi-Armed Bandit Problem: Decomposition and Computation (Q3755256):

Displaying 50 items.

• Response-adaptive designs for clinical trials: simultaneous learning from multiple patients (Q320737) (← links)
• Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
• Four proofs of Gittins' multiarmed bandit theorem (Q333080) (← links)
• Continue, quit, restart probability model (Q333092) (← links)
• Perspectives of approximate dynamic programming (Q333093) (← links)
• The multi-armed bandit, with constraints (Q378726) (← links)
• Derman's book as inspiration: some results on LP for MDPs (Q378728) (← links)
• An asymptotically optimal policy for finite support models in the multiarmed bandit problem (Q415624) (← links)
• The \(K\)-armed dueling bandits problem (Q440003) (← links)
• Stochastic scheduling: a short history of index policies and new approaches to index generation for dynamic resource allocation (Q490352) (← links)
• City streets parking enforcement inspection decisions: the Chinese postman's perspective (Q726240) (← links)
• On the resolution of misspecified convex optimization and monotone variational inequality problems (Q782913) (← links)
• Adaptive approaches to stochastic programming (Q806717) (← links)
• A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
• A generalized Gittins index for a Markov chain and its recursive calculation (Q945795) (← links)
• The learning component of dynamic allocation indices (Q1206729) (← links)
• On a new approach to the analysis of complex multi-armed bandits (Q1298696) (← links)
• Stochastic scheduling and forwards induction (Q1346693) (← links)
• A common value experimentation with multiarmed bandits (Q1720971) (← links)
• A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions (Q1735988) (← links)
• Enhancing gene expression programming based on space partition and jump for symbolic regression (Q2056306) (← links)
• An optimal stopping policy for car rental businesses with purchasing customers (Q2095189) (← links)
• Robust control of the multi-armed bandit problem (Q2095215) (← links)
• The performance of forwards induction policies (Q2368171) (← links)
• Finite state multi-armed bandit problems: Sensitive-discount, average-reward and average-overtaking optimality (Q2564701) (← links)
• Competing Markov decision processes (Q2638972) (← links)
• Ameso optimization: a relaxation of discrete midpoint convexity (Q2659175) (← links)
• Optimal learning with non-Gaussian rewards (Q2806349) (← links)
• Combinatorial multi-armed bandit and its extension to probabilistically triggered arms (Q2810845) (← links)
• On the solution of stochastic optimization and variational problems in imperfect information regimes (Q2832894) (← links)
• Computing a classic index for finite-horizon bandits (Q2899118) (← links)
• A faster index algorithm and a computational study for bandits with switching costs (Q2901010) (← links)
• The Irrevocable Multiarmed Bandit Problem (Q3098762) (← links)
• Optimal stopping of Markov chains and three abstract optimization problems (Q3108369) (← links)
• (Q3121140) (← links)
• Partially Observed Markov Decision Process Multiarmed Bandits—Structural Results (Q3169035) (← links)
• On Solving Finite State Multi-Armed Bandit Problem by Linear Programming (Q3360683) (← links)
• Tax problems in the undiscounted case (Q3367746) (← links)
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) (← links)
• Index Policies for Shooting Problems (Q3392111) (← links)
• Branching Bandit Processes (Q3415889) (← links)
• Incentivizing Exploration with Heterogeneous Value of Money (Q3460803) (← links)
• Index policies for discounted bandit problems with availability constraints (Q3516395) (← links)
• A Note on M. N. Katehakis' and Y.-R. Chen's Computation of the Gittins Index (Q3748086) (← links)
• A bisection/successive approximation method for computing Gittins indices (Q3970270) (← links)
• Dynamic allocation policies for the finite horizon one armed bandit problem (Q4215901) (← links)
• Survey of linear programming for standard and nonstandard Markovian control problems. Part II: Applications (Q4698111) (← links)
• The Nonstochastic Multiarmed Bandit Problem (Q4785631) (← links)
• On the optimal allocation of service to impatient tasks (Q4819435) (← links)
• A Structured Multiarmed Bandit Problem and the Greedy Policy (Q4974829) (← links)