Optimal Exploration–Exploitation in a Multi-armed Bandit Problem with Non-stationary Rewards (Q5113912): Difference between revisions

@@ Property / DOI @@
-.1287/stsy.2019.0033
@@ Property / DOI: 10.1287/stsy.2019.0033 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+AdaBoost.MH
@@ Property / describes a project that uses: AdaBoost.MH / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962821829
@@ Property / OpenAlex ID: W2962821829 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3316
@@ Property / arXiv ID: 1405.3316 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-time analysis of the multiarmed bandit problem
+Normal rank
@@ Property / cites work @@
+The Nonstochastic Multiarmed Bandit Problem
@@ Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Learning and Strategic Pricing
@@ Property / cites work: Learning and Strategic Pricing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3809068
@@ Property / cites work: Q3809068 / rank @@
+Normal rank
@@ Property / cites work @@
+Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
+Normal rank
@@ Property / cites work @@
+Non-Stationary Stochastic Optimization
@@ Property / cites work: Non-Stationary Stochastic Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+An analog of the minimax theorem for vector payoffs
+Normal rank
@@ Property / cites work @@
+Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
+Normal rank
@@ Property / cites work @@
+Dynamic Assortment with Demand Learning for Seasonal Consumer Goods
+Normal rank
@@ Property / cites work @@
+Prediction, Learning, and Games
@@ Property / cites work: Prediction, Learning, and Games / rank @@
+Normal rank
@@ Property / cites work @@
+Regret in the on-line decision problem
@@ Property / cites work: Regret in the on-line decision problem / rank @@
+Normal rank
@@ Property / cites work @@
+A decision-theoretic generalization of on-line learning and an application to boosting
+Normal rank
@@ Property / cites work @@
+On Upper-Confidence Bound Policies for Switching Bandit Problems
+Normal rank
@@ Property / cites work @@
+Q4197923
@@ Property / cites work: Q4197923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692329
@@ Property / cites work: Q4692329 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057976
@@ Property / cites work: Q4057976 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3245635
@@ Property / cites work: Q3245635 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5396640
@@ Property / cites work: Q5396640 / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotically efficient adaptive allocation rules
+Normal rank
@@ Property / cites work @@
+Regret bounds for restless Markov bandits
@@ Property / cites work: Regret bounds for restless Markov bandits / rank @@
+Normal rank
@@ Property / cites work @@
+Some aspects of the sequential design of experiments
+Normal rank
@@ Property / cites work @@
+Q2934090
@@ Property / cites work: Q2934090 / rank @@
+Normal rank
@@ Property / cites work @@
+Arm-acquiring bandits
@@ Property / cites work: Arm-acquiring bandits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3815845
@@ Property / cites work: Q3815845 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q126855665
@@ Property / Wikidata QID: Q126855665 / rank @@
+Normal rank
@@ Property / DOI @@
+.1287/STSY.2019.0033
@@ Property / DOI: 10.1287/STSY.2019.0033 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5113912