84 citations · 157 across the 8 of their papers we have counts for
10 papers
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities
Jose H. Blanchet, Martin I. Reiman, Viragh Shah +2
We consider a matching market where buyers and sellers arrive according to independent Poisson processes at the same rate and independently abandon the market if not matched after…
Semi-parametric dynamic contextual pricing
Virag Shah, Jose Blanchet, Ramesh Johari
Motivated by the application of real-time pricing in e-commerce platforms, we consider the problem of revenue-maximization in a setting where the seller can leverage contextual inf…
Optimal Testing in the Experiment-rich Regime
Sven Schmit, Virag Shah, Ramesh Johari
Motivated by the widespread adoption of large-scale A/B testing in industry, we propose a new experimentation framework for the setting where potential experiments are abundant (i.…
Bandit Learning with Positive Externalities
Virag Shah, Jose Blanchet, Ramesh Johari
In many platforms, user arrivals exhibit a self-reinforcing behavior: future user arrivals are likely to have preferences similar to users who were satisfied in the past. In other…
Delay Comparison of Delivery and Coding Policies in Data Clusters
Virag Shah, Anne Bouillard, Francois Baccelli
A key function of cloud infrastructure is to store and deliver diverse files, e.g., scientific datasets, social network information, videos, etc. In such systems, for the purpose o…
Adaptive Matching for Expert Systems with Uncertain Task Types
Virag Shah, Lennart Gulikers, Laurent Massoulie +1
A matching in a two-sided market often incurs an externality: a matched resource may become unavailable to the other side of the market, at least for a while. This is especially an…
Poly-Symmetry in Processor-Sharing Systems
Thomas Bonald, Céline Comte, Virag Shah +1
We consider a system of processor-sharing queues with state-dependent service rates. These are allocated according to balanced fairness within a polymatroid capacity set. Balanced…
Network Flows for Functions
Virag Shah, Bikash Kumar Dey, D. Manjunath
We consider in-network computation of an arbitrary function over an arbitrary communication network. A network with capacity constraints on the links is given. Some nodes in the ne…
Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View
Virag Shah, Neelesh B. Mehta, Raymond Yim
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been…
Optimal Timer Based Selection Schemes
Virag Shah, Neelesh B. Mehta, Raymond Yim
Timer-based mechanisms are often used to help a given (sink) node select the best helper node among many available nodes. Specifically, a node transmits a packet when its timer exp…