Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards
From MaRDI portal
Publication:5119417
DOI10.1287/stsy.2019.0055zbMath1441.90103arXiv1809.02016OpenAlexW3034216575MaRDI QIDQ5119417
Alessandro Arlotto, Xinchang Xie
Publication date: 4 September 2020
Published in: Stochastic Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.02016
Stochastic programming (90C15) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal online selection of a monotone subsequence: a central limit theorem
- The static stochastic knapsack problem with normally distributed item sizes
- Optimal sequential selection of a monotone sequence from a random sample
- Stochastic on-line knapsack problems
- The theory and practice of revenue management
- Re-solving stochastic programming models for airline revenue management
- The Dynamic and Stochastic Knapsack Problem
- Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
- A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
- TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards
- An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem
- Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- Asymptotic Behavior of an Allocation Policy for Revenue Management
- ‘Wald's Lemma' for sums of order statistics of i.i.d. random variables
- A note on the selection of random variables under a sum constraint
- An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
- A Stochastic Sequential Allocation Model
- A Renewal Decision Problem
- Average-Case Analysis of Off-Line and On-Line Knapsack Problems
- Smallest-fit selection of random sizes under a sum constraint: weak convergence and moment comparisons
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- The Dynamic and Stochastic Knapsack Problem with Deadlines
- A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
- An adaptive O(log n)‐optimal policy for the online selection of a monotone subsequence from a random sample
- Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes
- An Optimal Selection Problem for a Sequence with a Random Number of Applicants Per Period
- Optimal selection of stochastic intervals under a sum constraint
- Optimal Sequential Investment Decisions Under Conditions of Uncertainty
- Uniformly Bounded Regret in the Multisecretary Problem
- Approximations to Stochastic Dynamic Programs via Information Relaxation Duality
- Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management
- Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms
- The Bruss-Robertson Inequality:Elaborations, Extensions, and Applications
- Discrete-Variable Extremum Problems
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Stochastic combinatorial optimization via poisson approximation
This page was built for publication: Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards
