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 4 items.
- Regret bounds for restless Markov bandits (Q465253) (← links)
- A perpetual search for talents across overlapping generations: a learning process (Q898767) (← 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)
