Mohammad Hajiesmaili
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohammad Hajiesmaili has a total of 135 co-authors. Here are the top co-authors by number of shared publications:
- Adam Lechowicz
University of Massachusetts Amherst, Amherst, USA
21 shared publications - Adam Wierman
California Institute of Technology, Pasadena, California, United States
21 shared publications - Prashant Shenoy
University of Massachusetts Amherst, Amherst, Massachusetts, USA
21 shared publications - Noman Bashir
Massachusetts Institute of Technology, Cambridge, Massachusetts, USA
18 shared publications - John Chi-Shing Lui
The Chinese University of Hong Kong (CUHK)
16 shared publications - Bo Sun
University of Ottawa, Ottawa, ON, Canada
15 shared publications
Latest Publications
- Open Access
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 271-280
Online Joint Pricing and Scheduling in Distributed Networked Platforms
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 271-280
Open AccessOnline Joint Pricing and Scheduling in Distributed Networked Platforms
- Open Access
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 11-20
Reusable Resource Allocation under Adversarial Arrivals: Learning with Delayed Feedback
We study an online reusable resource allocation problem motivated by mobile edge AI platforms, where sequentially arriving requests must be immediately admitted and assigned to one of multiple edge service options with limited reusable capacities or offloaded to a remote central server. If accepted, a request occupies one service slot of the selected option for a random duration and yields a stochastic reward. The problem is particularly challenging because arrivals may be adversarial, reward and service-time statistics are both unknown and heterogeneous across request types and service options, and reward feedback can be delayed beyond service completion. To address these challenges, we propose an index-based online learning algorithm that combines optimistic reward estimates with a conservative, utilization-aware opportunity-cost penalty that captures the future value of reusable capacity. Using a primal-dual framework built on a novel reverse-order benchmark, we establish competitive-ratio guarantees under both bounded and light-tailed unbounded feedback delays. In particular, under a homogeneous reward-service model with i.i.d. inter-arrival times, our algorithm achieves an asymptotic competitive ratio of 1 - 1/e as reusable capacities grow large. Experimental results on a real-world dataset further demonstrate the effectiveness of our approach.
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 11-20
Open AccessReusable Resource Allocation under Adversarial Arrivals: Learning with Delayed Feedback
We study an online reusable resource allocation problem motivated by mobile edge AI platforms, where sequentially arriving requests must be immediately admitted and assigned to one of multiple edge service options with limited reusable capacities or offloaded to a remote central server. If accepted, a request occupies one service slot of the selected option for a random duration and yields a stochastic reward. The problem is particularly challenging because arrivals may be adversarial, reward and service-time statistics are both unknown and heterogeneous across request types and service options, and reward feedback can be delayed beyond service completion. To address these challenges, we propose an index-based online learning algorithm that combines optimistic reward estimates with a conservative, utilization-aware opportunity-cost penalty that captures the future value of reusable capacity. Using a primal-dual framework built on a novel reverse-order benchmark, we establish competitive-ratio guarantees under both bounded and light-tailed unbounded feedback delays. In particular, under a homogeneous reward-service model with i.i.d. inter-arrival times, our algorithm achieves an asymptotic competitive ratio of 1 - 1/e as reusable capacities grow large. Experimental results on a real-world dataset further demonstrate the effectiveness of our approach.
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1286-1297
Open AccessOnline Learning to Rank under Corruption: A Robust Cascading Bandits Approach
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 10-12
A Unified Framework for Online Combinatorial Allocation of Reusable Resources under Endogenous Deterioration
This paper studies an online resource allocation problem, where resources are reusable, allocated in combinatorial bundles, and subject to endogenous performance deterioration. Unlike existing models that assume singleton decisions or stationary or exogenous dynamics, we consider a combinatorial decision structure where decisions involve selecting among resource-bundled options, while capturing a self-induced feedback loop in which system performance, like rewards, activation probabilities, and service times, degrade as a function of cumulative resource usage. We propose a unified framework that subsumes a broad class of existing models as special cases, and develop a ranking-like online policy, termed IPRANK, which employs an indicator-perturbation mechanism to induce a randomized ranking over configurations based on their size-penalized rewards. Our analysis is based on a queue-coupling argument and shows that under adversarial arrivals, the greedy policy inevitably suffers a competitive ratio with linear dependence on reward heterogeneity, whereas IPRANK achieves a competitive ratio with only logarithmic dependence, making it far more robust in heterogeneous environments.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 10-12
Open AccessA Unified Framework for Online Combinatorial Allocation of Reusable Resources under Endogenous Deterioration
This paper studies an online resource allocation problem, where resources are reusable, allocated in combinatorial bundles, and subject to endogenous performance deterioration. Unlike existing models that assume singleton decisions or stationary or exogenous dynamics, we consider a combinatorial decision structure where decisions involve selecting among resource-bundled options, while capturing a self-induced feedback loop in which system performance, like rewards, activation probabilities, and service times, degrade as a function of cumulative resource usage. We propose a unified framework that subsumes a broad class of existing models as special cases, and develop a ranking-like online policy, termed IPRANK, which employs an indicator-perturbation mechanism to induce a randomized ranking over configurations based on their size-penalized rewards. Our analysis is based on a queue-coupling argument and shows that under adversarial arrivals, the greedy policy inevitably suffers a competitive ratio with linear dependence on reward heterogeneity, whereas IPRANK achieves a competitive ratio with only logarithmic dependence, making it far more robust in heterogeneous environments.
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 85-87
Online Smoothed Demand Management
We introduce and study a class of online problems called online smoothed demand management ( OSDM ), motivated by paradigm shifts in grid integration and energy storage for large energy consumers such as data centers. In OSDM , an operator makes two decisions at each time step: an amount of energy to be purchased, and an amount of energy to be delivered (i.e., used for computation). The difference between these decisions charges (or discharges) the operator's energy storage (e.g., a battery). Two types of demand arrive online: base demand, which must be covered at the current time, and flexible demand, which can be satisfied at any time steps before a demand-specific deadline Δ_t. The operator's goal is to minimize a cost (subject to the constraints above) that combines a cost of purchasing energy, a cost for delivering energy (if applicable), and smoothness penalties on the purchasing and delivery rates to discourage fluctuations and encourage ''grid healthy'' decisions. OSDM generalizes several problems in the online algorithms literature while being the first to fully model applications of interest. We propose a competitive algorithm for OSDM called PAAD (partitioned accounting & aggregated decisions) and show it achieves the optimal competitive ratio. To overcome the pessimism typical of worst-case analysis, we also propose a novel learning framework for OSDM that provides guarantees on the worst-case competitive ratio (i.e., to provide robustness against nonstationarity) while allowing end-to-end differentiable learning of the best algorithm on historical instances of the problem. We evaluate our algorithms in a case study of a grid-integrated data center with battery storage, showing that PAAD effectively solves the problem and end-to-end learning achieves substantial performance improvements compared to PAAD .
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 85-87
Open AccessOnline Smoothed Demand Management
We introduce and study a class of online problems called online smoothed demand management ( OSDM ), motivated by paradigm shifts in grid integration and energy storage for large energy consumers such as data centers. In OSDM , an operator makes two decisions at each time step: an amount of energy to be purchased, and an amount of energy to be delivered (i.e., used for computation). The difference between these decisions charges (or discharges) the operator's energy storage (e.g., a battery). Two types of demand arrive online: base demand, which must be covered at the current time, and flexible demand, which can be satisfied at any time steps before a demand-specific deadline Δ_t. The operator's goal is to minimize a cost (subject to the constraints above) that combines a cost of purchasing energy, a cost for delivering energy (if applicable), and smoothness penalties on the purchasing and delivery rates to discourage fluctuations and encourage ''grid healthy'' decisions. OSDM generalizes several problems in the online algorithms literature while being the first to fully model applications of interest. We propose a competitive algorithm for OSDM called PAAD (partitioned accounting & aggregated decisions) and show it achieves the optimal competitive ratio. To overcome the pessimism typical of worst-case analysis, we also propose a novel learning framework for OSDM that provides guarantees on the worst-case competitive ratio (i.e., to provide robustness against nonstationarity) while allowing end-to-end differentiable learning of the best algorithm on historical instances of the problem. We evaluate our algorithms in a case study of a grid-integrated data center with battery storage, showing that PAAD effectively solves the problem and end-to-end learning achieves substantial performance improvements compared to PAAD .
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 7-9
Heterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
We study a novel heterogeneous multi-agent multi-armed bandit problem with a cluster structure induced by stochastic block models (SBMs), influencing not only graph topology, but also reward heterogeneity. Specifically, agents are distributed on random graphs based on SBMs, a generalized Erdos-Renyi model with heterogeneous edge probabilities: agents are grouped into clusters (known or unknown); edge probabilities for agents within the same cluster differ from those across clusters. The same cluster structure in SBMs also determines our heterogeneous rewards. Rewards distributions of the same arm vary across agents in different clusters but remain consistent within a cluster, unifying homogeneous and heterogeneous settings and varying degree of heterogeneity. Rewards are independent samples from these distributions. The objective is to minimize system-wide regret across all agents. To address this, we propose a novel algorithm applicable to both known and unknown cluster settings. The algorithm combines an averaging-based consensus approach with a newly introduced information aggregation and weighting technique, resulting in a UCB-type strategy. It accounts for graph randomness, leverages both intra-cluster (homogeneous) and inter-cluster (heterogeneous) information from rewards and graphs, and incorporates cluster detection for unknown cluster settings. We derive optimal instance-dependent regret upper bounds of order log T under sub-Gaussian rewards. Importantly, our regret bounds capture the degree of heterogeneity in the system (an additional layer of complexity), exhibit smaller constants, scale better for large systems, and impose significantly relaxed assumptions on edge probabilities.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 7-9
Open AccessHeterogeneous Multi-agent Multi-armed Bandit on Stochastic Block Models
We study a novel heterogeneous multi-agent multi-armed bandit problem with a cluster structure induced by stochastic block models (SBMs), influencing not only graph topology, but also reward heterogeneity. Specifically, agents are distributed on random graphs based on SBMs, a generalized Erdos-Renyi model with heterogeneous edge probabilities: agents are grouped into clusters (known or unknown); edge probabilities for agents within the same cluster differ from those across clusters. The same cluster structure in SBMs also determines our heterogeneous rewards. Rewards distributions of the same arm vary across agents in different clusters but remain consistent within a cluster, unifying homogeneous and heterogeneous settings and varying degree of heterogeneity. Rewards are independent samples from these distributions. The objective is to minimize system-wide regret across all agents. To address this, we propose a novel algorithm applicable to both known and unknown cluster settings. The algorithm combines an averaging-based consensus approach with a newly introduced information aggregation and weighting technique, resulting in a UCB-type strategy. It accounts for graph randomness, leverages both intra-cluster (homogeneous) and inter-cluster (heterogeneous) information from rewards and graphs, and incorporates cluster detection for unknown cluster settings. We derive optimal instance-dependent regret upper bounds of order log T under sub-Gaussian rewards. Importantly, our regret bounds capture the degree of heterogeneity in the system (an additional layer of complexity), exhibit smaller constants, scale better for large systems, and impose significantly relaxed assumptions on edge probabilities.
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 88-90
Green Bin Packing
The online bin packing problem and its variants are regularly used to model server allocation problems. Modern concerns surrounding sustainability and overcommitment in cloud computing motivate bin packing models that capture costs associated with highly utilized servers. In this work, we introduce the green bin packing problem, an online variant with a linear cost β for filling above a fixed level G . For a given instance, the goal is to minimize the sum of the number of opened bins and the linear cost. We show that when β łe 1/G, classical online bin packing algorithms such as FirstFit or Harmonic perform well, and can achieve competitive ratios lower than in the classic setting. However, when β > 1/G, new algorithmic solutions can improve both worst-case and typical performance. We introduce variants of classic online bin packing algorithms and establish theoretical bounds, as well as test their empirical performance.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 88-90
Open AccessGreen Bin Packing
The online bin packing problem and its variants are regularly used to model server allocation problems. Modern concerns surrounding sustainability and overcommitment in cloud computing motivate bin packing models that capture costs associated with highly utilized servers. In this work, we introduce the green bin packing problem, an online variant with a linear cost β for filling above a fixed level G . For a given instance, the goal is to minimize the sum of the number of opened bins and the linear cost. We show that when β łe 1/G, classical online bin packing algorithms such as FirstFit or Harmonic perform well, and can achieve competitive ratios lower than in the classic setting. However, when β > 1/G, new algorithmic solutions can improve both worst-case and typical performance. We introduce variants of classic online bin packing algorithms and establish theoretical bounds, as well as test their empirical performance.
- Open Access
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 1-3
Learning to Allocate Reusable Resources under Stochastic Rewards and Durations
We study sequential allocation of a single reusable resource to stochastically arriving tasks in continuous time, where rewards and service durations are random with unknown statistics. When the resource is idle, the controller observes the arriving task's type and duration and must immediately accept or reject it; while the resource is busy, new arrivals are unobserved, which tightly couples learning and control. We first show that no non-anticipatory online policy can guarantee more than a 1/2 fraction of the full-information offline prophet benchmark, motivating the use of 1/2-approximate regret. To approach this limit, we derive an infinite-dimensional steady-state linear program that upper bounds the offline optimum and reveals a threshold structure: a task should be accepted when its profitability, defined as reward divided by duration plus expected waiting time, exceeds a critical threshold. Guided by this characterization, we develop online threshold-learning algorithms that achieve O (√ T ) 1/2-approximate regret when rewards are known and O (T 2/3 ) when reward functions are unknown. We further show that if durations are unobserved upon arrival, meaningful guarantees become impossible without additional flexibility, but can be recovered via task termination.
- 20 July 2026
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 54 (1) , 1-3
Open AccessLearning to Allocate Reusable Resources under Stochastic Rewards and Durations
We study sequential allocation of a single reusable resource to stochastically arriving tasks in continuous time, where rewards and service durations are random with unknown statistics. When the resource is idle, the controller observes the arriving task's type and duration and must immediately accept or reject it; while the resource is busy, new arrivals are unobserved, which tightly couples learning and control. We first show that no non-anticipatory online policy can guarantee more than a 1/2 fraction of the full-information offline prophet benchmark, motivating the use of 1/2-approximate regret. To approach this limit, we derive an infinite-dimensional steady-state linear program that upper bounds the offline optimum and reveals a threshold structure: a task should be accepted when its profitability, defined as reward divided by duration plus expected waiting time, exceeds a critical threshold. Guided by this characterization, we develop online threshold-learning algorithms that achieve O (√ T ) 1/2-approximate regret when rewards are known and O (T 2/3 ) when reward functions are unknown. We further show that if durations are unobserved upon arrival, meaningful guarantees become impossible without additional flexibility, but can be recovered via task termination.
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 417-428
The Price to Site: Cost-Effective Incentives for Solar Deployment
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 417-428
Open AccessThe Price to Site: Cost-Effective Incentives for Solar Deployment
- Open Access
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 202-234
Competitive and Learned Online Algorithms for HVAC Demand Management in Thermal Networks
- 22 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 202-234
Open AccessCompetitive and Learned Online Algorithms for HVAC Demand Management in Thermal Networks