Computational methods for bankruptcy problems

OPSEARCH · Springer Nature · 2026-11-17 · DOI: 10.1007/s10479-026-07476-4

Аннотация

In this paper, we discuss the computation of the most commonly used allocation rules for weighted bankruptcy problems. We extend existing recursive algorithms to the weighted constrained equal awards rule and the weighted constrained proportional rule, and prove their correctness. Moreover, we introduce novel solution methods for these rules, by providing an explicit expression for the allocations. Using duality, we extend these results to present algorithms for the weighted constrained equal losses rule and the weighted constrained proportional losses rule. The advantage of the novel solution method is demonstrated by a numerical example involving a network sharing application.

Читать у издателя →

Похожие статьи