Journal article · 2026 · Open access

Convexity of Inverse Blocking Curves in Loss Systems

Benjamin Legros

Operations Research · Published 12 October 2026 · DOI 10.1287/opre.2026.2623

Open full textView at the publisherCite this paper

In brief

“Convexity of Inverse Blocking Curves in Loss Systems” is a 2026 journal article by Benjamin Legros, published in Operations Research. OpenAlex counts 1 citations as of 18 November 2026. It is open access: the full text is free to read at SSRN Electronic Journal.

Citations
1
Most cited in
2026 (1)
Field-weighted impact
2.42
References
21
Authors
1

Abstract

Why Larger Service Systems Benefit More from Scale How much extra demand can a service system handle when capacity is increased while keeping the same target level of customer blocking? In the paper “Convexity of Inverse Blocking Curves in Loss Systems,” Benjamin Legros establishes an exact economies-of-scale result for loss systems. The paper proves that the maximum supportable demand is an increasing and globally convex function of the number of servers. In practical terms, as a system becomes larger, each additional server can support progressively more additional demand while maintaining the same blocking target. Equivalently, the extra capacity required to accommodate additional demand decreases as the system grows. The result provides a rigorous mathematical foundation for resource pooling in capacity-constrained services. It applies to the classical Erlang-B loss model and extends to systems with a finite waiting room, with potential relevance for telecommunications, healthcare, emergency response, and other service operations.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Legros, B. (2026). Convexity of Inverse Blocking Curves in Loss Systems. Operations Research. https://doi.org/10.1287/opre.2026.2623

MLA 9

Legros, Benjamin. “Convexity of Inverse Blocking Curves in Loss Systems.” Operations Research, 2026. https://doi.org/10.1287/opre.2026.2623.

Chicago

Legros, Benjamin. 2026. “Convexity of Inverse Blocking Curves in Loss Systems.” Operations Research. https://doi.org/10.1287/opre.2026.2623.

Harvard

Legros, B. (2026) ‘Convexity of Inverse Blocking Curves in Loss Systems’, Operations Research. doi:10.1287/opre.2026.2623.

IEEE

B. Legros, “Convexity of Inverse Blocking Curves in Loss Systems,” Operations Research, 2026, doi: 10.1287/opre.2026.2623.

BibTeX

@article{legros2026convexity,
  title     = {{Convexity of Inverse Blocking Curves in Loss Systems}},
  author    = {Legros, Benjamin},
  journal   = {Operations Research},
  year      = {2026},
  doi       = {10.1287/opre.2026.2623},
  url       = {https://doi.org/10.1287/opre.2026.2623}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Queuing Theory Analysis

  • economies of scale
  • loss systems
  • convexity
  • resource pooling
  • finite waiting room

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Legros, B. (2026). Convexity of Inverse Blocking Curves in Loss Systems. Operations Research. https://doi.org/10.1287/opre.2026.2623

How many times has this paper been cited?

1 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at SSRN Electronic Journal: sign in and open the full text from this page.

Who wrote this paper?

Benjamin Legros.

What is the DOI of this paper?

10.1287/opre.2026.2623, permanently at https://doi.org/10.1287/opre.2026.2623. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.