Mechanisms with learning for stochastic multi-armed bandit problems
From MaRDI portal
Recommendations
Cites work
- Asymptotically efficient adaptive allocation rules
- Dynamic pay-per-action mechanisms and applications to online advertising
- Finite-time analysis of the multiarmed bandit problem
- Foundations of mechanism design: a tutorial. II. Advanced concepts and results
- Game theory and mechanism design
- Optimal Auction Design
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Some aspects of the sequential design of experiments
- Thompson sampling: an asymptotically optimal finite-time analysis
- Truthful mechanisms with implicit payment computation
Cited in
(10)- On the value of learning for Bernoulli bandits with unknown parameters
- Machine learning and nonparametric bandit theory
- A quality assuring, cost optimal multi-armed bandit mechanism for expertsourcing
- Memory-Constrained No-Regret Learning in Adversarial Multi-Armed Bandits
- A reliability-aware multi-armed bandit approach to learn and select users in demand response
- Exploration and exploitation of scratch games
- ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS
- Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
- scientific article; zbMATH DE number 6542809 (Why is no real title available?)
- An Efficient Algorithm for Learning with Semi-bandit Feedback
This page was built for publication: Mechanisms with learning for stochastic multi-armed bandit problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2520139)