Pages that link to "Item:Q3770415"

The following pages link to Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (Q3770415):

Displayed 13 items.

• A perpetual search for talents across overlapping generations: a learning process (Q898767) ‎ (← links)
• Certainty equivalence control with forcing: Revisited (Q1264127) ‎ (← links)
• An online algorithm for the risk-aware restless bandit (Q2029383) ‎ (← links)
• Adaptive policies for perimeter surveillance problems (Q2286935) ‎ (← links)
• Asymptotically optimal algorithms for budgeted multiple play bandits (Q2331676) ‎ (← links)
• Optimal strategies for a class of sequential control problems with precedence relations (Q2456018) ‎ (← links)
• Arbitrary side observations in bandit problems (Q2483920) ‎ (← links)
• Distributed cooperative decision making in multi-agent multi-armed bandits (Q2663944) ‎ (← links)
• Polynomial-Time Algorithms for Multiple-Arm Identification with Full-Bandit Feedback (Q3386400) ‎ (← links)
• (Q5053221) ‎ (← links)
• Multiplayer Bandits Without Observing Collision Information (Q5085139) ‎ (← links)
• Managing caching strategies for stream reasoning with reinforcement learning (Q5140004) ‎ (← links)
• Learning in Combinatorial Optimization: What and How to Explore (Q5144784) ‎ (← links)