scientific article; zbMATH DE number 5485582
From MaRDI portal
Publication:5302093
zbMath1231.91048MaRDI QIDQ5302093
Eli Upfal, Aleksandrs Slivkins, Robert D. Kleinberg
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)
Related Items (28)
Random gradient-free minimization of convex functions ⋮ Continuous Assortment Optimization with Logit Choice Probabilities and Incomplete Information ⋮ Robustness of stochastic bandit policies ⋮ Adaptive-treed bandits ⋮ Context-based unsupervised ensemble learning and feature ranking ⋮ Multi-armed bandits with censored consumption of resources ⋮ Multi-armed bandit problem with online clustering as side information ⋮ Unnamed Item ⋮ Treatment recommendation with distributional targets ⋮ Gaussian process bandits with adaptive discretization ⋮ MNL-Bandit: A Dynamic Learning Approach to Assortment Selection ⋮ Bandits with Global Convex Constraints and Objective ⋮ Modeling item-item similarities for personalized recommendations on Yahoo! front page ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Filtered Poisson process bandit on a continuum ⋮ A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging ⋮ Truthful Mechanisms with Implicit Payment Computation ⋮ Randomized allocation with arm elimination in a bandit problem with covariates ⋮ Learning to Optimize via Information-Directed Sampling ⋮ Derivative-free optimization methods ⋮ Online Learning in Markov Decision Processes with Continuous Actions ⋮ Learning to Optimize via Posterior Sampling ⋮ Nonparametric Pricing Analytics with Customer Covariates ⋮ Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm ⋮ A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint ⋮ Satisficing in Time-Sensitive Bandit Learning ⋮ On two continuum armed bandit problems in high dimensions
This page was built for publication:
