Start of Main Content
Operations

Associate Professor of Operations

Portrait of Anton Braverman, Faculty at the Kellogg School of Management

Anton Braverman joined the Kellogg faculty in 2017. His research focuses on stochastic modeling and applied probability, with particular interests in queueing theory, stochastic-process approximations, and the analysis of large-scale service systems. His work has applications in areas including ridesharing, revenue management, and service operations.

Braverman received his Ph.D. in Operations Research from Cornell University and his B.S. in Mathematics and Statistics from the University of Toronto.

  • PhD, 2017, Operations Research, Cornell University
    MS, 2015, Operations Research, Cornell University
    BS, 2012, Math and Statistics, University of Toronto
  • Assistant Professor, Operations, Kellogg School of Management, Northwestern University, 2017-present
  • Sidney J. Levy Award for Excellence in Teaching 2024/25
    2017 Best Publication Award, The Applied Probability Society of INFORMS, 2016-2017

Asymptotic Methods in Operations (OPNS-530-0)

This course introduces the mathematical foundations and modeling principles behind fluid and diffusion limits, with an emphasis on their use as approximation tools in operations. Fluid limits often capture first-order, law-of-large-numbers behavior; diffusion limits capture second-order stochastic fluctuations. These approximations are not merely technical devices: they explain congestion, delay, variability, resource pooling, heavy traffic behavior, and the qualitative structure of good controls. The course is intended for PhD students who want to develop a rigorous and reusable toolkit for stochastic modeling. While many examples will come from queues and stochastic processing systems, the methods are broadly relevant across operations, applied probability, revenue management, marketplace design, service operations, healthcare operations, and data-driven decision making. Students who take the course should leave with both a conceptual understanding of why fluid and diffusion approximations work and a technical foundation for using these methods in their own research.

Queueing Networks: Models, Algorithms and Emerging Applications (OPNS-522-0)

This course aims to expose students to advanced methods in stochastic analysis and develop a toolbox of probabilistic analytical techniques. To focus the discussion, the course will be centered around queueing networks, which serve as building blocks in many modeling applications. Topics covered include fundamental queueing models, fluid and diffusion processes, limit theorems and approximations, and stochastic control. To discuss the algorithmic/computational elements of stochastic control, we will touch on approximate dynamic programming and explore how it is used in the control of queueing networks.

Stochastic Processes I (OPNS-516-1)

The course prepares the student with an understanding of Stochastic Processes. This course covers the following topics: Poisson Processes, discrete-time Markov chains, and continuous time Markov chains. It applies these concepts to queuing systems. Students are expected to have some background in probability.