An algorithm to compute a rule for division problems with multiple references

Authors

  • Francisca J. Sánchez-Sánchez Pablo de Olavide University image/svg+xml
    Spain

Keywords:

Division Problems, Multiple References, Cooperative Games, Talmud Rule, Algorithm

Abstract

In this paper we consider an extension of the classic division problem with claims: The division problem with multiple references. Hinojosa et al. (2012) provide a solution for this type of problems. The aim of this work is to extend their results by proposing an algorithm that calculates allocations based on these results. All computational details are provided in the paper.

Downloads

Download data is not yet available.

References

Downloads

Published

2012-12-31

Dimensions

PlumX

Issue

Vol. 13 No. 1 (2012): Rect@ Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Section

Artículos

License

How to Cite

Sánchez-Sánchez, F. J. (2012). An algorithm to compute a rule for division problems with multiple references. Revista Electrónica De Comunicaciones Y Trabajos De ASEPUMA, 13(1), 107-118. https://revistas.uma.es/index.php/recta/article/view/19976