SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Combinatorial Multi-Armed Bandit: General Framework and Applications
0 references·13 citing·29 second hop
Combinatorial Multi-Armed Bandit: General Framework and Applications (2013)Combinatorial Multi-Armed Bandit: General…Efficient learning by implicit exploration in bandit problems with side observations (2026)Efficient learning by implici…A Bayesian Partially Observable Online Change Detection Approach with Thompson Sampling (2022)A Bayesian Partially Observab…Combinatorial Sleeping Bandits With Fairness Constraints (2019)Combinatorial Sleeping Bandit…Combinatorial Sleeping Bandits with Fairness Constraints (2019)Combinatorial Sleeping Bandit…A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players (2019)A Practical Algorithm for Mul…A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns (2018)A Combinatorial-Bandit Algori…Stochastic Online Shortest Path Routing: The Value of Feedback (2017)Stochastic Online Shortest Pa…Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games (2016)Phased Exploration with Greed…Multiple-Play Bandits in the Position-Based Model (2016)Multiple-Play Bandits in the …Combinatorial Bandits Revisited (2015)Combinatorial Bandits Revisit…Matroid Bandits: Fast Combinatorial Optimization with Learning (2014)Matroid Bandits: Fast Combina…Efficient Learning in Large-Scale Combinatorial Semi-Bandits (2014)Efficient Learning in Large-S…Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Combinatorial Pure Exploratio…Using confidence bounds for exploitation-exploration trade-offs (2003)An Empirical Evaluation of Thompson Sampling (2011)Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Feedback-Aware Social Event-Participant Arrangement (2017)Thompson Sampling for Online Personalized Assortment Optimization Problems with Multinomial Logit Choice Models (2017)Finite-time Analysis of the Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed Bandit Problem (2002)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Non-Asymptotic Pure Exploration by Solving Games (2019)Pure Exploration with Multiple Correct Answers (2019)How to use expert advice (1997)Prediction, Learning, and Games (2006)Online Learning with Feedback Graphs: Beyond Bandits (2015)Causal Bandits: Learning Good Interventions via Causal Inference (2016)Delay and Cooperation in Nonstochastic Bandits (2016)Some aspects of the sequential design of experiments (1952)Algorithmic Game Theory (2007)Regret Minimization Under Partial Monitoring (2006)Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords (2007)Multi-Armed Bandit Allocation Indices. (1990)Multi-Armed Bandits with Fairness Constraints for Distributing Resources to Human Teammates (2020)Fairness in Learning-Based Sequential Decision Algorithms: A Survey (2021)Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback (2016)Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications (2018)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Achieving Fairness in the Stochastic Multi-Armed Bandit Problem (2020)Minimal Exploration in Structured Stochastic Bandits (2017)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2015Combinatorial Bandits Revisited124 cited
  • 2026Efficient learning by implicit exploration in bandit problems with side observations116 cited
  • 2014Combinatorial Pure Exploration of Multi-Armed Bandits104 cited
  • 2019Combinatorial Sleeping Bandits With Fairness Constraints87 cited
  • 2019Combinatorial Sleeping Bandits with Fairness Constraints85 cited
  • 2014Matroid Bandits: Fast Combinatorial Optimization with Learning80 cited
  • 2017Stochastic Online Shortest Path Routing: The Value of Feedback61 cited
  • 2016Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games52 cited
  • 2014Efficient Learning in Large-Scale Combinatorial Semi-Bandits48 cited
  • 2018A Combinatorial-Bandit Algorithm for the Online Joint Bid/Budget Optimization of Pay-per-Click Advertising Campaigns45 cited
  • 2019A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players43 cited
  • 2016Multiple-Play Bandits in the Position-Based Model38 cited
  • 2022A Bayesian Partially Observable Online Change Detection Approach with Thompson Sampling22 cited

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