Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/opre.2021.2164 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Fast Algorithms for Online Stochastic Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Near-Optimal Algorithm for Online Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly Bounded Regret in the Multisecretary Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic simulation: Algorithms and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Rademacher complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Competitive Online Algorithms via a Primal—Dual Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Network Revenue Management Using Thompson Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the van Trees inequality: A Bayesian Cramér-Rao bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How the Experts Algorithm Can Help Solve LPs Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Deterministic LP-Based Booking Limit and Bid Price Controls for Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Pricing with an Unknown Demand Model: Asymptotically Optimal Semi-Myopic Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal beats dual on online packing LPs in the random-order model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting distributions for \(L_1\) regression estimators under general conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearly Relaxed Approximate Linear Program for Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Mechanism Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of Online Packing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Asymptotically Optimal Policy for a Quantity-Based Network Revenue Management Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Behavior of Optimal Solutions in Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Bid-Price Controls for Network Revenue Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Projections for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/OPRE.2021.2164 / rank
 
Normal rank

Latest revision as of 15:46, 30 December 2024

scientific article; zbMATH DE number 7625928
Language Label Description Also known as
English
Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
scientific article; zbMATH DE number 7625928

    Statements

    Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (English)
    0 references
    0 references
    0 references
    1 December 2022
    0 references
    online linear programming
    0 references
    stochastic programming
    0 references
    sequential decision making
    0 references
    stochastic dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers