Download This PaperSome Properties of the Erlang-B and Erlang-C Formulae (Technical Supplement to 'Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers')
9 Pages Posted: 11 May 2023
Date Written: April 26, 2023
Abstract
The Erlang-B and Erlang-C formulae are fundamental formulae in queueing theory. This document compiles some important properties of these formulae. This document serves as a technical supplement to Zhong et al. (2023) "Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers", augmenting the accompanying Electronic Companion (EC) with the proofs for Lemmas EC.1, EC.2, EC.3, EC.12 and EC.13.
Suggested Citation: Suggested Citation
Zhong, Yueyang and Gopalakrishnan, Ragavendran and Ward, Amy, Some Properties of the Erlang-B and Erlang-C Formulae (Technical Supplement to 'Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers') (April 26, 2023). Available at SSRN: https://ssrn.com/abstract=4430477 or http://dx.doi.org/10.2139/ssrn.4430477
Yueyang Zhong (Contact Author)
The University of Chicago Booth School of Business ( email )
5807 S. Woodlawn Avenue
Chicago, IL 60637
United States
Feedback
Feedback to SSRN