39 citations · 207 across the 58 of their papers we have counts for
70 papers
On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization
Rahul Vaze
A constrained version of the online convex optimization (OCO) problem is considered. With slotted time, for each slot, first an action is chosen. Subsequently the loss function and…
Online facility location with weights and congestion
Arghya Chakraborty, Rahul Vaze
The classic online facility location problem deals with finding the optimal set of facilities in an online fashion when demand requests arrive one at a time and facilities need to…
Non-asymptotic near optimal algorithms for two sided matchings
Rahul Vaze, Jayakrishnan Nair
A two-sided matching system is considered, where servers are assumed to arrive at a fixed rate, while the arrival rate of customers is modulated via a price-control mechanism. We a…
Minimizing Age of Information under Arbitrary Arrival Model with Arbitrary Packet Size
Kumar Saurav, Rahul Vaze
We consider a single source-destination pair, where information updates arrive at the source at arbitrary time instants. For each update, its size, i.e. the service time required f…
Scheduling for Multi-Phase Parallelizable Jobs
Rahul Vaze
With multiple identical unit speed servers, the online problem of scheduling jobs that migrate between two phases, limitedly parallelizable or completely sequential, and choosing t…
Scheduling to Minimize Age of Information with Multiple Sources
Kumar Saurav, Rahul Vaze
We consider a G/G/1 queueing system with a single server, where updates arrive from different sources stochastically with possibly different update inter-generation time distributi…