SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism
16 references·0 citing·36 second hop
Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism (2020)Reinforcement Learning for Non-Stationary…Closing the Gap: A Learning Algorithm for Lost-Sales Inventory Systems with Lead Times (2019)Closing the Gap: A Learning A…Real-Time Bidding by Reinforcement Learning in Display Advertising (2017)Real-Time Bidding by Reinforc…Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium (2017)Learning in Repeated Auctions…Efficient Contextual Bandits in Non-stationary Worlds (2017)Efficient Contextual Bandits …On-Demand Service Platforms (2016)On-Demand Service PlatformsChasing Demand: Learning and Earning in a Changing Environment (2016)Chasing Demand: Learning and …Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits (2014)Tight Regret Bounds for Stoch…Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…On Upper-Confidence Bound Policies for Switching Bandit Problems (2011)On Upper-Confidence Bound Pol…Improved Algorithms for Linear Stochastic Bandits (2011)Improved Algorithms for Linea…Online Markov Decision Processes under Bandit Feedback (2010)Online Markov Decision Proces…Near-optimal Regret Bounds for Reinforcement Learning (2010)Near-optimal Regret Bounds fo…Markov Decision Processes with Arbitrary Reward Processes (2009)Markov Decision Processes wit…A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand (2009)A Nonparametric Asymptotic An…The Nonstochastic Multiarmed Bandit Problem (2002)The Nonstochastic Multiarmed …Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting (1997)Prediction, Learning, and Games (2006)Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis (2012)Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards (2014)A Stochastic Approximation Method (1951)Introduction to Online Convex Optimization (2016)Introduction to Online Convex Optimization (2016)Introduction to Multi-Armed Bandits (2019)Some aspects of the sequential design of experiments (1952)Online Learning and Online Convex Optimization (2011)Online Learning and Online Convex Optimization (2012)Foundations of Inventory Management (2000)Online convex programming and generalized infinitesimal gradient ascent (2003)Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator (2011)On Implications of Demand Censoring in the Newsvendor Problem (2013)Non-Stationary Stochastic Optimization (2015)Existence and Uniqueness of Equilibrium Points for Concave N-Person Games (1965)The Theory and Practice of Revenue Management (2004)Learning and Efficiency in Games with Dynamic Population (2015)Reinforcement Mechanism Design: With Applications to Dynamic Pricing in Sponsored Search Auctions (2020)Multiplicative Pacing Equilibria in Auction Markets (2021)The Regulation of Queue Size by Levying Tolls (1969)Supply Chain Coordination with Contracts (2003)Between autonomy and control: Strategies of arbitrage in the “on-demand” economy (2017)The Rise of the Sharing Economy: Estimating the Impact of Airbnb on the Hotel Industry (2017)Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers (2018)Your Uber Is Arriving: Managing On-Demand Workers Through Surge Pricing, Forecast Communication, and Worker Incentives (2019)Regret Bounds for the Adaptive Control of Linear Quadratic Systems (2011)Confronting Deep Uncertainties in Risk Analysis (2012)A Tutorial on Thompson Sampling (2018)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Combinatorial Bandits Revisited (2015)Combinatorial Multi-Armed Bandit with General Reward Functions (2016)Minimal Exploration in Structured Stochastic Bandits (2017)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 2002The Nonstochastic Multiarmed Bandit Problem2,210 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
  • 2011Improved Algorithms for Linear Stochastic Bandits860 cited
  • 2010Near-optimal Regret Bounds for Reinforcement Learning718 cited
  • 2016On-Demand Service Platforms603 cited
  • 2011On Upper-Confidence Bound Policies for Switching Bandit Problems455 cited
  • 2009A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand220 cited
  • 2014Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits155 cited
  • 2017Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium151 cited
  • 2016Chasing Demand: Learning and Earning in a Changing Environment139 cited
  • 2017Real-Time Bidding by Reinforcement Learning in Display Advertising115 cited
  • 2019Closing the Gap: A Learning Algorithm for Lost-Sales Inventory Systems with Lead Times102 cited
  • 2017Efficient Contextual Bandits in Non-stationary Worlds100 cited
  • 2009Markov Decision Processes with Arbitrary Reward Processes93 cited

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

  • 2010Online Markov Decision Processes under Bandit Feedback88 cited
  • Cited by

    No citing works inside the corpus for this window.