Siva Theja Maguluri

Associate Professor

Georgia Institute of Technology
Country flagUnited States

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Articles (12)

Year:

2026

Year:

2026

Year:

2026

We study electric vehicle (EV) fleet and charging infrastructure planning in a spatial setting. For a centrally managed fleet that serves customer requests arriving continuously at a rate [Formula: see text] throughout the day, we determine the minimum number of vehicles and chargers for a target service level along with matching and charging policies. Whereas non-EV systems require extra [Formula: see text] vehicles because of pickup times, EV systems differ. Charging increases nominal capacity, enabling pickup time reductions and allowing for an extra fleet requirement of only [Formula: see text] for [Formula: see text], depending on charging infrastructure and battery pack sizes. We propose the power-of-d dispatching policy, which achieves this performance by selecting the closest vehicle with the highest battery level from d options. We extend our results to accommodate time-varying demand patterns and discuss conditions for transitioning between EV and non-EV capacity planning. Simulations verify our scaling results, insights, and policy effectiveness. Whereas long-range, fast-charging fleets resemble non-EV systems, short-range, low-cost fleets can still perform competitively, underscoring the need for EV-aware management policies. This paper was accepted by Victor Martínez de Albéniz, operations management. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2024.08524 .

Year:

2026

Year:

2026

We consider a load-balancing system composed of a fixed number of single-server queues operating under the well-known join-the-shortest queue policy and where jobs/customers are impatient and abandon if they do not receive service after some (random) amount of time. In this setting, we characterize the centered and appropriately scaled steady-state queue-length distribution (hereafter referred to as limiting distribution) in the limit as the abandonment rate goes to zero at the same time as the load either converges to one or is larger than one. Depending on the arrival, service, and abandonment rates, we observe three different regimes of operation that yield three different limiting distributions. The first regime is when the system is underloaded, and its load converges relatively slowly to one. In this case, abandonments do not affect the limiting distribution, and we obtain the same exponential distribution as in the system without abandonments. When the load converges to one faster, we have the second regime, where abandonments become significant. Here, the system undergoes a phase transition, and the limiting distribution is a truncated Gaussian. Further, the third regime is when the system is heavily overloaded, and so, the queue lengths are very large. In this case, we show that the limiting distribution converges to a normal distribution. To establish our results, we first prove a weaker form of state space collapse by providing a uniform bound on the second moment of the (unscaled) perpendicular component of the queue lengths, which shows that the system behaves like a single-server queue. We then use exponential Lyapunov functions to characterize the limiting distribution of the steady-state queue-length vector. Funding: This work was supported by the National Science Foundation [Grants CMMI-2140534 and EPCN-2144316].

Year:

2026

Year:

2026

We consider the load-balancing system under Poisson arrivals, exponential services, and homogeneous servers under the power-of-d choices routing algorithm, which chooses the queue with minimum length among d randomly sampled queues. We study this system in the sub-Halfin-Whitt regime. In particular, we consider a sequence of systems with n servers, where the arrival rate of the nth system is [Formula: see text] for [Formula: see text]. It was shown that under power-of-d choices routing with [Formula: see text], the queue length behaves similarly to that of joining the shortest queue and that there are asymptotically zero queueing delays. The focus of this paper is to characterize the behavior when d is below this threshold. We obtain high probability bounds on the queue lengths for various values of d and large enough n. In particular, we show that when d is [Formula: see text] for some integer [Formula: see text], then the asymptotic queue length is m with high probability. Moreover, if d grows poly-log in n, that is, slower than any polynomial, but is at least [Formula: see text], the queue length blows up to infinity asymptotically. We obtain these results by using an iterative state space collapse approach. Funding: This work was partially supported by the National Science Foundation [Grants EPCN-2144316 and CMMI-2140534].

Year:

2025

Service systems like data centers and ride-hailing are popularly modeled as queueing systems in the literature. Such systems are primarily studied in the steady state due to their analytical tractability. However, almost all applications in real life do not operate in a steady state, so there is a clear discrepancy in translating theoretical queueing results to practical applications. To this end, we provide a finite-time convergence for Erlang-C systems (also known as M/M/n queues), providing a stepping stone towards understanding the transient behavior of more general queueing systems. We obtain a bound on the Chi-square distance between the finite time queue length distribution and the stationary distribution for a finite number of servers. We then use these bounds to study the behavior in the many-server heavy-traffic asymptotic regimes. The Erlang-C model exhibits a phase transition at the so-called Halfin-Whitt regime. We show that our mixing rate matches the limiting behavior in the Super-Halfin-Whitt regime and matches up to a constant factor in the Sub-Halfin-Whitt regime. To prove such a result, we employ the Lyapunov-Poincaré approach, where we first carefully design a Lyapunov function to obtain a negative drift outside a finite set. Within the finite set, we develop different strategies depending on the properties of the finite set to get a handle on the mixing behavior via a local Poincaré inequality. A key aspect of our methodological contribution is in obtaining tight guarantees in these two regions, which when combined, give us tight mixing time bounds. We believe that this approach is of independent interest for studying mixing in reversible countable-state Markov chains more generally.

Year:

2025

The stochastic approximation (SA) method stands as the foundational mathematical tool for modern large-scale optimization and machine learning. Therefore, gaining a theoretical understanding of SA algorithms is of fundamental interest. In their paper titled “A Lyapunov Theory for Finite-Sample Guarantees of Markovian Stochastic Approximation,” Chen et al. present a unified Lyapunov framework for the finite-sample analysis of a Markovian SA algorithm under a contractive operator with respect to an arbitrary norm. The key novelty lies in the construction of a smooth Lyapunov function called the generalized Moreau envelope. The authors demonstrate the effectiveness of their SA results in the context of reinforcement learning (RL), specifically through popular algorithms such as variants of temporal difference (TD) learning and Q-learning. As byproducts, the results provide theoretical insights into the efficiency of bootstrapping in TD learning with eligibility traces and the bias-variance tradeoff in off-policy learning.

Year:

2024

Year:

2023

Year:

2023

Collaborators (4)

Debankur Mukherjee

Assistant Professor

Georgia Institute of Technology

UNITED STATES
View details

Sanjay Shakkottai

Professor

University of Texas at Austin

UNITED STATES
View details

Francisco Castro

Assistant professor

University of California, Los Angeles

UNITED STATES
View details

Sajad Khodadadian

Assistant Professor

Virginia Tech

UNITED STATES
View details