A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
Fuente:
arXiv
Guardado en:
| Autores principales: | Shen, Owen, Xu, Haoran, Ye, Yinyu, Glynn, Peter, Jaillet, Patrick |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
por: Xu, Haoran, et al.
Publicado: (2026)
por: Xu, Haoran, et al.
Publicado: (2026)
Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)
por: Gao, Wenzhi, et al.
Publicado: (2021)
Online Resource Allocation with Convex-set Machine-Learned Advice
por: Golrezaei, Negin, et al.
Publicado: (2023)
por: Golrezaei, Negin, et al.
Publicado: (2023)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)
por: Su, Yuexin, et al.
Publicado: (2026)
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
por: Jin, Billy, et al.
Publicado: (2022)
por: Jin, Billy, et al.
Publicado: (2022)
A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)
por: Xu, Pan
Publicado: (2025)
Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
por: Zhai, Jianing, et al.
Publicado: (2019)
por: Zhai, Jianing, et al.
Publicado: (2019)
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
por: Sun, Shuo, et al.
Publicado: (2024)
por: Sun, Shuo, et al.
Publicado: (2024)
Improved Approximation Guarantees for Joint Replenishment in Continuous Time
por: Segev, Danny
Publicado: (2024)
por: Segev, Danny
Publicado: (2024)
Online Matching on $3$-Uniform Hypergraphs
por: Borst, Sander, et al.
Publicado: (2024)
por: Borst, Sander, et al.
Publicado: (2024)
Diversity-Fair Online Selection
por: Hu, Ming, et al.
Publicado: (2025)
por: Hu, Ming, et al.
Publicado: (2025)
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)
por: Segev, Danny
Publicado: (2025)
Online Decision Making with Fairness over Time
por: Chen, Rui, et al.
Publicado: (2022)
por: Chen, Rui, et al.
Publicado: (2022)
Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
por: Segev, Danny
Publicado: (2026)
por: Segev, Danny
Publicado: (2026)
Dynamic Batching of Online Arrivals to Leverage Economies of Scale
por: Bhimaraju, Akhil, et al.
Publicado: (2023)
por: Bhimaraju, Akhil, et al.
Publicado: (2023)
The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)
por: Henke, Dorothee
Publicado: (2024)
Dynamic Pricing for Reusable Resources: The Power of Two Prices
por: Balseiro, Santiago R., et al.
Publicado: (2023)
por: Balseiro, Santiago R., et al.
Publicado: (2023)
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)
por: Housni, Omar El, et al.
Publicado: (2024)
Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)
Online Linear Programming with Replenishment
por: Chen, Yuze, et al.
Publicado: (2026)
por: Chen, Yuze, et al.
Publicado: (2026)
Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)
Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
por: Su, Yuexin, et al.
Publicado: (2025)
por: Su, Yuexin, et al.
Publicado: (2025)
Online Stochastic Packing with General Correlations
por: Cetin, Sabri, et al.
Publicado: (2025)
por: Cetin, Sabri, et al.
Publicado: (2025)
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)
por: Chen, Yike, et al.
Publicado: (2024)
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
por: Brubaker, Kyle, et al.
Publicado: (2025)
por: Brubaker, Kyle, et al.
Publicado: (2025)
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
por: Chen, Shengminjie, et al.
Publicado: (2023)
por: Chen, Shengminjie, et al.
Publicado: (2023)
Competitive Online Optimization under Inventory Constraints
por: Lin, Qiulin, et al.
Publicado: (2019)
por: Lin, Qiulin, et al.
Publicado: (2019)
Convergence analysis of wide shallow neural operators within the framework of Neural Tangent Kernel
por: Xu, Xianliang, et al.
Publicado: (2024)
por: Xu, Xianliang, et al.
Publicado: (2024)
Optimal Decentralized Smoothed Online Convex Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2024)
por: Bhuyan, Neelkamal, et al.
Publicado: (2024)
Infrequent Resolving Algorithm for Online Linear Programming
por: Li, Guokai, et al.
Publicado: (2024)
por: Li, Guokai, et al.
Publicado: (2024)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
por: Dvořák, Michal, et al.
Publicado: (2026)
por: Dvořák, Michal, et al.
Publicado: (2026)
Coordinating Spot and Contract Supply in Freight Marketplaces
por: Kaminsky, Philip, et al.
Publicado: (2026)
por: Kaminsky, Philip, et al.
Publicado: (2026)
On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)
por: Muluk, Komal
Publicado: (2026)
Handicap reduction for linear complementarity problems
por: -Nagy, Marianna E., et al.
Publicado: (2026)
por: -Nagy, Marianna E., et al.
Publicado: (2026)
Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
por: Chang, Claire, et al.
Publicado: (2026)
por: Chang, Claire, et al.
Publicado: (2026)
Improved Speed via Regional Fulfillment
por: Hathcock, Daniel, et al.
Publicado: (2026)
por: Hathcock, Daniel, et al.
Publicado: (2026)
Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
por: Altschuler, Jason M., et al.
Publicado: (2026)
por: Altschuler, Jason M., et al.
Publicado: (2026)
Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
por: Segev, Danny
Publicado: (2026)
por: Segev, Danny
Publicado: (2026)
Circuit Diameter of Polyhedra is Strongly Polynomial
por: Natura, Bento
Publicado: (2026)
por: Natura, Bento
Publicado: (2026)
Approximation Schemes for Sequential Hiring Problems
por: Segev, Danny, et al.
Publicado: (2026)
por: Segev, Danny, et al.
Publicado: (2026)
Ejemplares similares
-
A Single-Sample Polylogarithmic Regret Bound for Nonstationary Online Linear Programming
por: Xu, Haoran, et al.
Publicado: (2026) -
Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021) -
Online Resource Allocation with Convex-set Machine-Learned Advice
por: Golrezaei, Negin, et al.
Publicado: (2023) -
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026) -
Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
por: Jin, Billy, et al.
Publicado: (2022)