#Nas Botond Apor #Comparing bankruptcy rules by sum of ranking differences in a scalable cloud computing environment
#Started March 10, 2020
nasbotond/bankruptcy_game
The bankruptcy problem is the allocation of a perfectly divisible amount between a set of claimants where the total demand of the claimants exceeds the distributable amount. Bankruptcy rules define the division of such goods between the claimants in any given bankruptcy problem. However, each of these rules are deficient in some way. A comparison can be drawn between the rules using a statistical method, called Sum of Ranking Differences, that ranks competing solutions based on a reference point to evaluate the fairness of each rule. A bankruptcy situation can be modeled as a cooperative bankruptcy game, based on the bankruptcy problem, where the claimants can form coalitions in which allocations are enforced through binding agreements.
Java