SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
2 references·4 citing·23 second hop
An Asymptotic Minimax Theorem for the Two Armed Bandit Problem (1960)An Asymptotic Minimax Theorem for the Two…On Sequential Designs for Maximizing the Sum of $n$ Observations (1956)On Sequential Designs for Max…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…An Information-Theoretic Approach to Minimax Regret in Partial Monitoring (2019)An Information-Theoretic Appr…The multi-armed bandit problem with covariates (2013)The multi-armed bandit proble…Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space (1989)Asymptotically efficient adap…Randomized Allocation of Treatments in Sequential Experiments (1981)Randomized Allocation of Trea…A Stochastic Approximation Method (1951)The Nonstochastic Multiarmed Bandit Problem (2002)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards (1987)Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost (1988)Bounded regret in stochastic multi-armed bandits (2013)Latent Bandits. (2014)DCM Bandits: Learning to Rank with Multiple Clicks (2016)Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems (2006)The Epoch-Greedy Algorithm for Multi-armed Bandits with Side Information (2007)Dynamic Assortment Personalization in High Dimensions (2020)Nonparametric Pricing Analytics with Customer Covariates (2021)Fast Rates for Contextual Linear Optimization (2022)Bandit Processes and Dynamic Allocation Indices (1979)Multi-Armed Bandits and the Gittins Index (1980)Recent Developments in the Methods of Optimum and Related Experimental Designs (1988)A dynamic programming approach to the efficient design of clinical trials (2001)Prediction, Learning, and Games (2006)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Contributions to the "Two-Armed Bandit" Problem (1962)Dynamic priority allocation via restless bandit marginal productivity indices (2007)Learning to signal: Analysis of a micro-level reinforcement model (2008)
this work references cited by second hop

References

  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1956On Sequential Designs for Maximizing the Sum of $n$ Observations222 cited

Cited by

  • 2013The multi-armed bandit problem with covariates122 cited
  • 2019An Information-Theoretic Approach to Minimax Regret in Partial Monitoring73 cited
  • 1981Randomized Allocation of Treatments in Sequential Experiments71 cited
  • 1989Asymptotically efficient adaptive allocation schemes for controlled i.i.d. processes: finite parameter space54 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work