Pages that link to "Item:Q3780858"
From MaRDI portal
The following pages link to Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards (Q3780858):
Displaying 9 items.
- Regret bounds for restless Markov bandits (Q465253) (← links)
- A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
- Certainty equivalence control with forcing: Revisited (Q1264127) (← links)
- Asymptotically efficient strategies for a stochastic scheduling problem with order constraints. (Q1848847) (← links)
- Efficient crowdsourcing of unknown experts using bounded multi-armed bandits (Q2014933) (← links)
- Arbitrary side observations in bandit problems (Q2483920) (← links)
- (Q3798561) (← links)
- A Bandit-Learning Approach to Multifidelity Approximation (Q5022495) (← links)
- Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
