Pages that link to "Item:Q1879915"
From MaRDI portal
The following pages link to When can the two-armed bandit algorithm be trusted? (Q1879915):
Displaying 13 items.
- Randomized urn models revisited using stochastic approximation (Q363849) (← links)
- Robustness of stochastic bandit policies (Q391739) (← links)
- On ergodic two-armed bandits (Q417067) (← links)
- Convergence in models with bounded expected relative hazard rates (Q472194) (← links)
- Stochastic approximation of quasi-stationary distributions on compact spaces and applications (Q1617129) (← links)
- Nonlinear randomized urn models: a stochastic approximation viewpoint (Q2274219) (← links)
- On the robustness of learning in games with stochastically perturbed payoff observations (Q2357809) (← links)
- Penalty-Regulated Dynamics and Robust Learning Procedures in Games (Q3449451) (← links)
- How Fast Is the Bandit? (Q3506304) (← links)
- (Q4638249) (← links)
- Regret bounds for Narendra-Shapiro bandit algorithms (Q5086451) (← links)
- Analysis of the smoothly amnesia-reinforced multidimensional elephant random walk (Q6062725) (← links)
- Networks of reinforced stochastic processes: probability of asymptotic polarization and related general results (Q6570493) (← links)
