Computer implementation of bankruptcy rules
In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rul...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2004
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/22517 |
| Aporte de: |
| Sumario: | In this paper we describe a computer system that calculates allocation to claims according to two kinds of bankruptcy rules. The first kind implemented are those whose results corresponds to the classical solutions of game theory: The Talmud rule, the Proportional rule, the Adjusted Proportional rule, the Constrained Equal Awards rule and the Random Arrival rule. The second type implemented generates assignations to claims that have no correspondence with the classical results, they are: Piniles´ rule, the Constrained Egalitarian rule and Constrained Equal Losses rule.
This computer system was developed in order to compute the different allocations to claims in Allocation problems, distribution problems and Assignment problems for real cases and to be used in education of game theory and decision problems. The system generates numerical and graphical results. It allows comparisons between the numerical results and their graphic representations. It also allows the exportation of the different outputs to any windows application. |
|---|