Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
From MaRDI portal
Publication:5058054
DOI10.1287/opre.2021.2164OpenAlexW3216981873MaRDI QIDQ5058054
Publication date: 1 December 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.05499
stochastic programmingstochastic dynamic programmingsequential decision makingonline linear programming
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limiting distributions for \(L_1\) regression estimators under general conditions
- Applications of the van Trees inequality: A Bayesian Cramér-Rao bound
- Local Rademacher complexities
- Stochastic simulation: Algorithms and analysis
- An Analysis of Bid-Price Controls for Network Revenue Management
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- How the Experts Algorithm Can Help Solve LPs Online
- Geometry of Online Packing Linear Programs
- Bayesian Mechanism Design
- Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems
- A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
- An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem
- Online Primal-Dual Algorithms for Covering and Packing
- Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Lectures on Stochastic Programming
- Asymptotic Behavior of Optimal Solutions in Stochastic Programming
- A Linearly Relaxed Approximate Linear Program for Markov Decision Processes
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- Uniformly Bounded Regret in the Multisecretary Problem
- Online Network Revenue Management Using Thompson Sampling
- Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management
- Random Projections for Linear Programming
- Primal beats dual on online packing LPs in the random-order model
- Fast Algorithms for Online Stochastic Convex Programming
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
This page was built for publication: Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
