A Dynamic Near-Optimal Algorithm for Online Linear Programming
From MaRDI portal
Publication:2931707
DOI10.1287/opre.2014.1289zbMath1302.90119arXiv0911.2974OpenAlexW2148352389MaRDI QIDQ2931707
Zizhuo Wang, Yinyu Ye, Shipra Agrawal
Publication date: 26 November 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.2974
Related Items (36)
Deals or No Deals: Contract Design for Online Advertising ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Online Appointment Scheduling in the Random Order Model ⋮ Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds ⋮ A dynamic learning algorithm for online matching problems with concave returns ⋮ Primal Beats Dual on Online Packing LPs in the Random-Order Model ⋮ Competitive online algorithms for resource allocation over the positive semidefinite cone ⋮ A stochastic algorithm for online bipartite resource allocation problems ⋮ Model Predictive Control for Dynamic Resource Allocation ⋮ New results for the \(k\)-secretary problem ⋮ Bicriteria Online Matching: Maximizing Weight and Cardinality ⋮ Primal-dual analysis for online interval scheduling problems ⋮ Online stochastic weighted matching algorithm for real‐time shared parking ⋮ Configuration balancing for stochastic requests ⋮ Online allocation and display ads optimization with surplus supply ⋮ Simple and fast algorithm for binary integer and online linear programming ⋮ Unnamed Item ⋮ A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility ⋮ Bandits with Global Convex Constraints and Objective ⋮ An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Unnamed Item ⋮ Railway delay management with passenger rerouting considering train capacity constraints ⋮ Improved online algorithms for Knapsack and GAP in the random order model ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Iterative computation of security strategies of matrix games with growing action set ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ How the Experts Algorithm Can Help Solve LPs Online ⋮ Online Stochastic Matching: New Algorithms with Better Bounds ⋮ On the resolution of misspecified convex optimization and monotone variational inequality problems ⋮ Online Resource Allocation Under Partially Predictable Demand ⋮ Unnamed Item ⋮ Provably training overparameterized neural network classifiers with non-convex constraints ⋮ Online generalized assignment problem with historical information ⋮ Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems ⋮ Fair Resource Allocation in a Volatile Marketplace
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak convergence and empirical processes. With applications to statistics
- An Analysis of Bid-Price Controls for Network Revenue Management
- Geometry of Online Packing Linear Programs
- Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
- Online Primal-Dual Algorithms for Covering and Packing
- AdWords and generalized online matching
- Improved Bounds for Online Stochastic Matching
- Online Stochastic Packing Applied to Display Ad Allocation
- A Knapsack Secretary Problem with Applications
- Asymptotic Behavior of an Allocation Policy for Revenue Management
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
- Online Stochastic Matching: Beating 1-1/e
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Prediction, Learning, and Games
This page was built for publication: A Dynamic Near-Optimal Algorithm for Online Linear Programming
