SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Matching While Learning
16 references·0 citing·35 second hop
Matching While Learning (2021)Matching While LearningOnline Network Revenue Management Using Thompson Sampling (2018)Online Network Revenue Manage…Dynamic pricing and learning: Historical origins, current research, and new directions (2015)Dynamic pricing and learning:…Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems (2014)Close the Gaps: A Learning-Wh…Bandits with concave rewards and convex knapsacks (2014)Bandits with concave rewards …Simultaneously Learning and Optimizing Using Controlled Variance Pricing (2013)Simultaneously Learning and O…Optimal Dynamic Assortment Planning with Demand Learning (2013)Optimal Dynamic Assortment Pl…Combinatorial Multi-Armed Bandit: General Framework and Applications (2013)Combinatorial Multi-Armed Ban…Bandits with Knapsacks (2013)Bandits with KnapsacksRegret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Regret Analysis of Stochastic…Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations (2012)Combinatorial Network Optimiz…Blind Network Revenue Management (2012)Blind Network Revenue Managem…Analysis of Thompson Sampling for the multi-armed bandit problem (2011)Analysis of Thompson Sampling…Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms (2009)Dynamic Pricing Without Knowi…Finite-time Analysis of the Multiarmed Bandit Problem (2002)Finite-time Analysis of the M…Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1990)Stability properties of const…The assignment game I: The core (1971)The assignment game I: The co…Multi-Armed Bandit Allocation Indices. (1990)An Empirical Evaluation of Thompson Sampling (2011)Thompson Sampling for Contextual Bandits with Linear Payoffs (2012)Learning to Optimize via Posterior Sampling (2014)Introduction to Multi-Armed Bandits (2019)The Theory of Games and Economic Behavior (1945)College Admissions and the Stability of Marriage (1962)On cores and indivisibility (1974)Job Matching, Coalition Formation, and Gross Substitutes (1982)The Stability of Hedonic Coalition Structures (2002)Theory of games and economic behavior (2019)Using confidence bounds for exploitation-exploration trade-offs (2003)Stochastic Linear Optimization Under Bandit Feedback (2008)Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms (2014)Decentralized Learning for Multiplayer Multiarmed Bandits (2014)Cascading Bandits: Learning to Rank in the Cascade Model (2015)Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons (1994)Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions (2003)The Theory and Practice of Revenue Management (2004)Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies (2014)A Stochastic Approximation Method (1951)Prediction, Learning, and Games (2006)Non-Stationary Stochastic Optimization (2015)Personalized Dynamic Pricing with Machine Learning: High-Dimensional Features and Heterogeneous Elasticity (2021)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems (2012)Information-seeking, curiosity, and attention: computational and neural mechanisms (2013)A unified framework for stochastic optimization (2018)Bandit Algorithms (2020)A Tutorial on Thompson Sampling (2018)Generative artificial intelligence in supply chain and operations management: a capability-based framework for analysis and implementation (2024)Autonomous algorithmic collusion: Q‐learning under sequential pricing (2021)Combinatorial Pure Exploration of Multi-Armed Bandits (2014)Combinatorial Bandits Revisited (2015)Efficient learning by implicit exploration in bandit problems with side observations (2026)
this work references cited by second hop

References

  • 2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
  • 1971The assignment game I: The core1,714 cited
  • 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,275 cited
  • 2011Analysis of Thompson Sampling for the multi-armed bandit problem904 cited
  • 2009Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms510 cited
  • 2015Dynamic pricing and learning: Historical origins, current research, and new directions434 cited
  • 2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
  • 2013Combinatorial Multi-Armed Bandit: General Framework and Applications392 cited
  • 2018Online Network Revenue Management Using Thompson Sampling243 cited
  • 2013Simultaneously Learning and Optimizing Using Controlled Variance Pricing214 cited
  • 2013Bandits with Knapsacks211 cited
  • 1990Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks195 cited
  • 2014Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems183 cited
  • 2013Optimal Dynamic Assortment Planning with Demand Learning181 cited

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

2012
Blind Network Revenue Management
171 cited
  • 2014Bandits with concave rewards and convex knapsacks122 cited
  • Cited by

    No citing works inside the corpus for this window.