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

Autores/as

  • Francisca J. Sánchez-Sánchez Universidad Pablo de Olavide España

Palabras clave:

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

Resumen

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.

Descargas

Publicado

2012-12-31

Cómo citar

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. Recuperado a partir de https://revistas.uma.es/index.php/recta/article/view/19976

Número

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

Sección

Artículos

Licencia

Creative Commons License

Esta obra está bajo una licencia internacional Creative Commons Atribución-NoComercial 4.0.