Cover Image

Robust Dynamic Staffing with Predictions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Yiding, Manshadi, Vahideh, Niazadeh, Rad, Neyshabouri, Saba
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
by: Bansak, Kirk, et al.
Published: (2024)

Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring
by: Aminian, Mohammad Reza, et al.
Published: (2025)

Near-Optimal Bayesian Online Assortment of Reusable Resources
by: Feng, Yiding, et al.
Published: (2025)

Misalignment, Learning, and Ranking: Harnessing Users Limited Attention
by: Agarwal, Arpit, et al.
Published: (2024)

Robustness of Online Inventory Balancing to Inventory Shocks
by: Feng, Yiding, et al.
Published: (2025)

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

Online Resource Allocation with Cancellations
by: Ekbatani, Farbod, et al.
Published: (2022)

Online Smoothed Demand Management
by: Lechowicz, Adam, et al.
Published: (2025)

Online Job Assignment
by: Ekbatani, Farbod, et al.
Published: (2025)

Private Edge Density Estimation for Random Graphs: Optimal, Efficient and Robust
by: Chen, Hongjie, et al.
Published: (2024)

Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
by: Chen, Hongjie, et al.
Published: (2025)

Distributionally Robust Optimization with Adversarial Data Contamination
by: Li, Shuyao, et al.
Published: (2025)

Robust Learning of a Group DRO Neuron
by: Cao, Guyang, et al.
Published: (2026)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
by: Li, Shuyao, et al.
Published: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)

Adaptive control of dynamic networks
by: Pan, Chunyu, et al.
Published: (2023)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
by: Li, Bowen, et al.
Published: (2024)

Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
by: Ferreira, Ricardo N., et al.
Published: (2025)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
by: Shugart, Henry, et al.
Published: (2025)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
by: Shugart, Henry, et al.
Published: (2025)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
by: Shah, Harsh, et al.
Published: (2025)

Oracle-based Uniform Sampling from Convex Bodies
by: Dang, Thanh, et al.
Published: (2025)

Discrete and Continuous Difference of Submodular Minimization
by: Orfanides, George, et al.
Published: (2025)

Gradient Testing and Estimation by Comparisons
by: Tao, Xiwen, et al.
Published: (2024)

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
by: Kim, Jung-hun, et al.
Published: (2021)

Constrained and Composite Sampling via Proximal Sampler
by: Dang, Thanh, et al.
Published: (2026)

Importance Sparsification for Sinkhorn Algorithm
by: Li, Mengyu, et al.
Published: (2023)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
by: Fountoulakis, Kimon, et al.
Published: (2026)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
by: Chakraborty, Somnath, et al.
Published: (2020)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
by: Kook, Yunbum, et al.
Published: (2023)

Learning-Augmented Algorithms for the Bahncard Problem
by: Zhao, Hailiang, et al.
Published: (2024)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
by: Zhang, Hongyang R., et al.
Published: (2023)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
by: Jambulapati, Arun, et al.
Published: (2024)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
by: Cai, Yang, et al.
Published: (2022)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)