SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Game of Thrones: Fully Distributed Learning for Multiplayer Bandits
16 references·0 citing·39 second hop
Game of Thrones: Fully Distributed Learning for Multiplayer Bandits (2020)Game of Thrones: Fully Distributed Learni…MNL-Bandit: A Dynamic Learning Approach to Assortment Selection (2019)MNL-Bandit: A Dynamic Learnin…Distributed cooperative decision-making in multiarmed bandits: Frequentist and Bayesian algorithms (2016)Distributed cooperative decis…Distributed Clustering of Linear Bandits in Peer to Peer Networks (2016)Distributed Clustering of Lin…Multi-Player Bandits -- a Musical Chairs Approach (2015)Multi-Player Bandits -- a Mus…Learning to Optimize via Posterior Sampling (2014)Learning to Optimize via Post…Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Decentralized Learning for Mu…Achieving Pareto Optimality Through Distributed Learning (2014)Achieving Pareto Optimality T…Regret in Online Combinatorial Optimization (2013)Regret in Online Combinatoria…Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems (2013)Deterministic Sequencing of E…Online Learning of Rested and Restless Bandits (2012)Online Learning of Rested and…Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics (2012)Learning in a Changing World:…Learning efficient Nash equilibria in distributed systems (2012)Learning efficient Nash equil…1 1 Online Learning of Rested and Restless Bandits (2012)1 1 Online Learning of Rested…Distributed Learning in Multi-Armed Bandit With Multiple Players (2010)Distributed Learning in Multi…Markov Decision Processes with Arbitrary Reward Processes (2009)Markov Decision Processes wit…Regret Minimization Under Partial Monitoring (2006)Regret Minimization Under Par…The Theory of Learning in Games (1998)The Nonstochastic Multiarmed Bandit Problem (2002)Minimizing Regret With Label Efficient Prediction (2005)Prediction, Learning, and Games (2006)Partial Monitoring—Classification, Regret Bounds, and Algorithms (2014)Sequential Learning for Multi-Channel Wireless Network Monitoring With Channel Switching Costs (2014)Learning, Mutation, and Long Run Equilibria in Games (1993)The Evolution of Conventions (1993)The Statistical Mechanics of Strategic Interaction (1993)Empirical Centroid Fictitious Play: An Approach for Distributed Learning in Multi-Agent Games (2015)Evolutionary Game Theory: A Renaissance (2018)Learning Generalized Nash Equilibria in a Class of Convex Games (2018)Sample mean based index policies byO(logn) regret for the multi-armed bandit problem (1995)The Complexity of Optimal Queuing Network Control (1999)Finite-time Analysis of the Multiarmed Bandit Problem (2002)Channel Selection for Network-Assisted D2D Communication via No-Regret Bandit Learning With Calibrated Forecasting (2014)Risk-Averse Multi-Armed Bandit Problems Under Mean-Variance Measure (2016)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)A Tutorial on Thompson Sampling (2018)A unified framework for stochastic optimization (2018)Online Decision Making with High-Dimensional Covariates (2019)Bandit Processes and Dynamic Allocation Indices (1979)Multi-armed bandits with application to 5G small cells (2016)A Stochastic Approximation Method (1951)A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Combinatorial Bandits Revisited (2015)Learning to Optimize via Information-Directed Sampling (2017)Discrete Choice Analysis: Theory and Application to Travel Demand. (1987)Discrete Choice Methods with Simulation (2001)Dynamic Assortment Personalization in High Dimensions (2020)Restaurant analytics: Emerging practice and research opportunities (2022)Operational Research: methods and applications (2023)Some aspects of the sequential design of experiments (1952)On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits (2016)Delay and Cooperation in Nonstochastic Bandits (2016)SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits (2018)Federated Multi-Armed Bandits (2021)
this work references cited by second hop

References

  • 2014Learning to Optimize via Posterior Sampling494 cited
  • 2010Distributed Learning in Multi-Armed Bandit With Multiple Players386 cited
  • 2013Regret in Online Combinatorial Optimization210 cited
  • 2014Decentralized Learning for Multiplayer Multiarmed Bandits158 cited
  • 2019MNL-Bandit: A Dynamic Learning Approach to Assortment Selection144 cited
  • 20121 1 Online Learning of Rested and Restless Bandits141 cited
  • 2012Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics139 cited
  • 2006Regret Minimization Under Partial Monitoring138 cited
  • 2012Learning efficient Nash equilibria in distributed systems134 cited
  • 2015Multi-Player Bandits -- a Musical Chairs Approach117 cited
  • 2012Online Learning of Rested and Restless Bandits114 cited
  • 2014Achieving Pareto Optimality Through Distributed Learning112 cited
  • 2016Distributed Clustering of Linear Bandits in Peer to Peer Networks101 cited
  • 2009Markov Decision Processes with Arbitrary Reward Processes93 cited
  • 2013Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems90 cited

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

2016
Distributed cooperative decision-making in multiarmed bandits: Frequentist and Bayesian algorithms
82 cited

Cited by

No citing works inside the corpus for this window.