Pages that link to "Item:Q3835405"
From MaRDI portal
The following pages link to Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost (Q3835405):
Displayed 9 items.
- A perpetual search for talents across overlapping generations: a learning process (Q898767) (← links)
- Online regret bounds for Markov decision processes with deterministic transitions (Q982638) (← links)
- Certainty equivalence control with forcing: Revisited (Q1264127) (← links)
- Optimal learning and experimentation in bandit problems. (Q1614793) (← links)
- Arbitrary side observations in bandit problems (Q2483920) (← links)
- Online Regret Bounds for Markov Decision Processes with Deterministic Transitions (Q3529915) (← links)
- Gittins Index for Simple Family of Markov Bandit Processes with Switching Cost and No Discounting (Q5240313) (← links)
- Some indexable families of restless bandit problems (Q5395354) (← links)
- Generalized Bandit Problems (Q5486926) (← links)