Multi-armed bandit with sub-exponential rewards
type: Item
instance of: scholarly article
title: Multi-armed bandit with sub-exponential rewards
author: Huiwen Jia
author: Cong Shi
author: Siqian Shen
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7442918
zbMATH Keywords: multi-armed bandit
zbMATH Keywords: unbounded reward
zbMATH Keywords: sub-exponential reward
zbMATH Keywords: upper confidence bound
Wikidata QID: Q115568192
MaRDI profile type: Publication
full work available at URL: j.orl.2021.08.004
OpenAlex ID: W3195308870
cites work: Q4907706
cites work: Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
cites work: Bandits With Heavy Tail
cites work: Pricing of reusable resources under ambiguous distributions of demand and service time with emerging applications
cites work: An Introduction to Heavy-Tailed and Subexponential Distributions
cites work: Bandit Algorithms
cites work: The concentration of measure phenomenon
cites work: Some aspects of the sequential design of experiments
cites work: Learning to Optimize via Posterior Sampling
cites work: Inventory rebalancing and vehicle routing in bike sharing systems
cites work: Online Learning and Online Convex Optimization
cites work: Introduction to Multi-Armed Bandits
DOI: 10.1016/J.ORL.2021.08.004
Recommended article: Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards
Recommended article: Multi-armed bandits in discrete and continuous time
Recommended article: Independently Expiring Multiarmed Bandits
Recommended article: Multi-armed bandit problem revisited
Recommended article: Q3813090
Recommended article: The Multi-Armed Bandit With Stochastic Plays
Recommended article: The Nonstochastic Multiarmed Bandit Problem
description: scientific article; zbMATH DE number 7442918