10 papers
A Heavy Traffic Theory of Matching Queues
Sushil Mahavir Varma, Siva Theja Maguluri
Motivated by emerging applications in online matching platforms and marketplaces, we study a matching queue. Customers and servers that arrive in a matching queue depart as soon as…
Efficiency-Reward Trade-Off in Queues with Dynamic Arrivals
Tianze Qu, Sushil Mahavir Varma
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. T…
Transform Method for Stochastic Processing and Matching Networks
Sushil Mahavir Varma, Prakirt Jhunjhunwala, Daniela Hurtado-Lange +1
Modern service systems, ranging from cloud data centers and ride-hailing platforms to healthcare facilities, operate at massive scales where it is important to handle congestion. Q…
Phase Transition in Convex Relaxations for Graph Alignment
Laurent Massoulié, Sushil Mahavir Varma, Louis Vassaux +1
We study the graph alignment problem for correlated Gaussian Orthogonal Ensemble (GOE) matrices, where the goal is to recover a hidden vertex permutation given two correlated symme…
Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets
Zixian Yang, Sushil Mahavir Varma, Lei Ying
We study a two-sided market, wherein, price-sensitive heterogeneous customers and servers arrive and join their respective queues. A compatible customer-server pair can then be mat…
Graph Alignment via Birkhoff Relaxation
Sushil Mahavir Varma, Irène Waldspurger, Laurent Massoulié
We consider the graph alignment problem, wherein the objective is to find a vertex correspondence between two graphs that maximizes the edge overlap. The graph alignment problem is…