Imagen de Portada

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Besbes, Omar, Kanoria, Yash, Kumar, Akshit
Formato:	Preprint
Publicado:	2022
Materias:	Probability Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Availability is all you need: achieving optimal regret with minimal information for dynamic matching
por: Kerimov, Süleyman, et al.
Publicado: (2025)

Online Stochastic Packing with General Correlations
por: Cetin, Sabri, et al.
Publicado: (2025)

Asymptotics of solutions to the linear search problem
por: Heinonen, Robin A.
Publicado: (2026)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

Active Learning for Non-Parametric Choice Models
por: Susan, Fransisca, et al.
Publicado: (2022)

On Smale's 17th problem over the reals
por: Montanari, Andrea, et al.
Publicado: (2024)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2023)

SCaLE: Switching Cost aware Learning and Exploration
por: Bhuyan, Neelkamal, et al.
Publicado: (2026)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
por: Chen, Yilun, et al.
Publicado: (2025)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
por: Balseiro, Santiago R., et al.
Publicado: (2023)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
por: Sun, Shuo, et al.
Publicado: (2024)

Online Resource Allocation with Convex-set Machine-Learned Advice
por: Golrezaei, Negin, et al.
Publicado: (2023)

A uniformity principle for spatial matching
por: Ameen, Taha, et al.
Publicado: (2026)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
por: Feng, Yiding, et al.
Publicado: (2026)

When Location Shapes Choice: Placement Optimization of Substitutable Products
por: Housni, Omar El, et al.
Publicado: (2023)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
por: Chen, Yike, et al.
Publicado: (2024)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
por: Segev, Danny
Publicado: (2026)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
por: Hunkenschröder, Christoph, et al.
Publicado: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
por: Zhai, Jianing, et al.
Publicado: (2019)

A Decomposition Theorem for Dynamic Flows
por: Graf, Lukas, et al.
Publicado: (2024)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
por: Bhimaraju, Akhil, et al.
Publicado: (2023)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
por: Moeini, Mahdi, et al.
Publicado: (2024)

Coordinating Spot and Contract Supply in Freight Marketplaces
por: Kaminsky, Philip, et al.
Publicado: (2026)

Polynomial time algorithm for optimal stopping with fixed accuracy
por: Goldberg, David A., et al.
Publicado: (2018)

Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
por: Segev, Danny
Publicado: (2025)

Platoon Forming Algorithms for Intelligent Street Intersections
por: Timmerman, R. W., et al.
Publicado: (2019)

Distance Estimation for High-Dimensional Discrete Distributions
por: Kumar, Gunjan, et al.
Publicado: (2023)

Online Multiple Resource Allocation Problems with Departures via the Primal-Dual Approach
por: Amidu, Yusuf, et al.
Publicado: (2025)

Interior point methods are not worse than Simplex
por: Allamigeon, Xavier, et al.
Publicado: (2022)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
por: Jin, Billy, et al.
Publicado: (2022)

A nearly optimal randomized algorithm for explorable heap selection
por: Borst, Sander, et al.
Publicado: (2022)

Online Decision Making with Fairness over Time
por: Chen, Rui, et al.
Publicado: (2022)

Solving the Probabilistic Profitable Tour Problem on a Tree
por: Angelelli, Enrico, et al.
Publicado: (2022)