Rearrangement Algorithm

Python implementation of a rearrangement algorithm that can be used to calculate bounds on the value-at-risk (VaR) of dependent risks.

The current version includes the following calculations:

• Upper and lower bounds on the VaR of dependent risks¹
• Upper and lower bounds on the survival probability of functions of dependent risks²
• Upper and lower bounds on the expected value of supermodular functions of dependent risks³

Mathematical Background

Mathematical details and derivations can be found in the publications¹²³.

More information and an overview of extensions can be found on the website of the Rearrangement Algorithm project.

Implementation

Parts of this implementation are based on the qrmtools R package (version 0.0-13) by M. Hofert, K. Hornik, and A. J. McNeil. Details on the algorithm and the R implementation can be found in the paper "Implementing the Rearrangement Algorithm: An Example from Computational Risk Management", M. Hofert, In: Risks, vol. 8, no. 2, 2020⁴.

Installation

You can install the package via pip

pip install rearrangement-algorithm

If you want to install the latest (unstable) version, you can install the package from source

git clone https://gitlab.com/klb2/rearrangement-algorithm.git
cd rearrangement-algorithm
git checkout dev
pip install .

Documentation

You can find the documentation for this package on Read the Docs.
This also includes some usage examples.

License and Referencing

This program is licensed under the GPLv3 license. If you in any way use this code for research that results in publications, please cite this package.

Parts of this code are based on the qrmtools R package (version 0.0-13), which is also released under the GPLv3 license.

References