Pages that link to "Item:Q2931707"

The following pages link to A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707):

Displaying 34 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• A dynamic learning algorithm for online matching problems with concave returns (Q319996) (← links)
• A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
• On the resolution of misspecified convex optimization and monotone variational inequality problems (Q782913) (← links)
• Competitive online algorithms for resource allocation over the positive semidefinite cone (Q1650777) (← links)
• Railway delay management with passenger rerouting considering train capacity constraints (Q2028881) (← links)
• Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
• Provably training overparameterized neural network classifiers with non-convex constraints (Q2106783) (← links)
• Online generalized assignment problem with historical information (Q2108140) (← links)
• Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
• Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts (Q2285050) (← links)
• Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
• New results for the \(k\)-secretary problem (Q2658048) (← links)
• How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
• Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems (Q2875601) (← links)
• Model Predictive Control for Dynamic Resource Allocation (Q2925344) (← links)
• Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
• Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
• Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
• Sequential Interdiction with Incomplete Information and Learning (Q4971578) (← links)
• (Q5002749) (← links)
• Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
• Fair Resource Allocation in a Volatile Marketplace (Q5031013) (← links)
• Deals or No Deals: Contract Design for Online Advertising (Q5031634) (← links)
• Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
• (Q5090369) (← links)
• Bandits with Global Convex Constraints and Objective (Q5129206) (← links)
• An Approximation Algorithm for Network Revenue Management Under Nonstationary Arrivals (Q5130511) (← links)
• Nonstationary Bandits with Habituation and Recovery Dynamics (Q5144777) (← links)
• Online Stochastic Matching: New Algorithms with Better Bounds (Q5244859) (← links)
• A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility (Q5372620) (← links)
• (Q5743510) (← links)
• Online stochastic weighted matching algorithm for real‐time shared parking (Q6080597) (← links)
• Simple and fast algorithm for binary integer and online linear programming (Q6160284) (← links)