SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Algorithms for multi-armed bandit problems
4 references·5 citing·29 second hop
Algorithms for multi-armed bandit problems (2014)Algorithms for multi-armed bandit problemsFinite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Multi-Armed Bandit Allocation Indices. (1990)Multi-Armed Bandit Allocation…Individual Choice Behavior: A Theoretical Analysis. (1960)Individual Choice Behavior: A…Some aspects of the sequential design of experiments (1952)Some aspects of the sequentia…Comparisons of Auction Designs Through Multiagent Learning in Peer-to-Peer Energy Trading (2022)Comparisons of Auction Design…Risk-aware multi-armed bandit problem with application to portfolio selection (2017)Risk-aware multi-armed bandit…Boltzmann Exploration Done Right (2017)Boltzmann Exploration Done Ri…A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit (2015)A Survey of Online Experiment…A Survey of Preference-Based Online Learning with Bandit Algorithms (2014)A Survey of Preference-Based …Rank Correlation Methods. (1957)Prediction, Learning, and Games (2006)A Stochastic Approximation Method (1951)Bandit Processes and Dynamic Allocation Indices (1979)The Nonstochastic Multiarmed Bandit Problem (2002)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)On Upper-Confidence Bound Policies for Non-Stationary Bandit Problems (2008)Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (2014)A Survey on Contextual Multi-armed Bandits (2015)Reinforcement Mechanism Design for e-commerce (2018)Transferable Contextual Bandit for Cross-Domain Recommendation (2018)Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates (2020)KULLBACK-LEIBLER UPPER CONFIDENCE BOUNDS FOR OPTIMAL SEQUENTIAL ALLOCATION (2013)A formal model for multiagent Q-learning on graphs (2025)PORTFOLIO SELECTION* (1952)The Pricing of Options and Corporate Liabilities (1973)Coherent Measures of Risk (1999)Differentially-Private Federated Linear Bandits (2020)Bandit-based inventory optimisation: Reinforcement learning in multi-echelon supply chains (2022)The Evolution of Reinforcement Learning in Quantitative Finance: A Survey (2025)COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS (1961)Algorithmic Game Theory (2007)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Introduction to Multi-Armed Bandits (2019)Elimination by aspects: A theory of choice. (1972)Task complexity and contingent processing in decision making: An information search and protocol analysis (1976)Increasing Returns and Path Dependence in the Economy (1994)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1960Individual Choice Behavior: A Theoretical Analysis.2,504 cited
  • 1952Some aspects of the sequential design of experiments2,183 cited
  • 1990Multi-Armed Bandit Allocation Indices.997 cited

Cited by

  • 2017Boltzmann Exploration Done Right96 cited
  • 2015A Survey of Online Experiment Design with the Stochastic Multi-Armed Bandit87 cited
  • 2017Risk-aware multi-armed bandit problem with application to portfolio selection61 cited
  • 2022Comparisons of Auction Designs Through Multiagent Learning in Peer-to-Peer Energy Trading50 cited
  • 2014A Survey of Preference-Based Online Learning with Bandit Algorithms37 cited

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