17 citations · 55 across the 12 of their papers we have counts for
14 papers
The BAR approach for multiclass queueing networks with SBP service policies
Anton Braverman, J. G. Dai, Masakiyo Miyazawa
The basic adjoint relationship (BAR) approach is an analysis technique based on the stationary equation of a Markov process. This approach was introduced to study heavy-traffic, st…
The join-the-shortest-queue system in the Halfin-Whitt regime: rates of convergence to the diffusion limit
Anton Braverman
We show that the steady-state distribution of the join-the-shortest-queue (JSQ) system converges, in the Halfin-Whitt regime, to its diffusion limit at a rate of at least $1/\sqrt{…
The prelimit generator comparison approach of Stein's method
Anton Braverman
This paper uses the generator comparison approach of Stein's method to analyze the gap between steady-state distributions of Markov chains and diffusion processes. The "standard" g…
High order steady-state diffusion approximations
Anton Braverman, J. G. Dai, Xiao Fang
We derive and analyze new diffusion approximations of stationary distributions of Markov chains that are based on second- and higher-order terms in the expansion of the Markov chai…
Steady-state diffusion approximations of Markov chains: error analysis via the discrete Poisson equation
Anton Braverman
This paper uses the generator approach of Stein's method to analyze the gap between steady-state distributions of Markov chains and diffusion processes. Until now, the standard way…
On the Taylor Expansion of Value Functions
Anton Braverman, Itai Gurvich, Junfei Huang
We introduce a framework for approximate dynamic programming that we apply to discrete time chains on with countable action sets. Our approach is grounded in the a…
Steady-state analysis of the Join the Shortest Queue model in the Halfin-Whitt regime
Anton Braverman
This paper studies the steady-state properties of the Join the Shortest Queue model in the Halfin-Whitt regime. We focus on the process tracking the number of idle servers, and the…
Stein's method for steady-state diffusion approximations
Anton Braverman
Diffusion approximations have been a popular tool for performance analysis in queueing theory, with the main reason being tractability and computational efficiency. This dissertati…
Empty-car routing in ridesharing systems
Anton Braverman, J. G. Dai, Xin Liu +1
This paper considers a closed queueing network model of ridesharing systems such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car…
High order steady-state diffusion approximation of the Erlang-C system
Anton Braverman, J. G. Dai
In this paper we introduce a new diffusion approximation for the steady-state customer count of the Erlang-C system. Unlike previous diffusion approximations, which use the steady-…
Stein's method for steady-state diffusion approximations: an introduction through the Erlang-A and Erlang-C models
Anton Braverman, J. G. Dai, Jiekun Feng
This paper provides an introduction to the Stein method framework in the context of steady-state diffusion approximations. The framework consists of three components: the Poisson e…
Poisson statistics of eigenvalues in the hierarchical Dyson model
Alexander Bendikov, Anton Braverman, John Pike
Let be a locally compact separable ultrametric space. Given a measure on and a function defined on the set of all balls we consider t…
Heavy traffic approximation for the stationary distribution of a generalized Jackson network: the BAR approach
Anton Braverman, J. G. Dai, Masakiyo Miyazawa
In the seminal paper of Gamarnik and Zeevi (2006), the authors justify the steady-state diffusion approximation of a generalized Jackson network (GJN) in heavy traffic. Their appro…
Stein's method for steady-state diffusion approximations of systems
Anton Braverman, J. G. Dai
We consider queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that o…