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

Authors

  • Francisca J. Sánchez-Sánchez Universidad Pablo de Olavide 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.

Publication Facts

Metric
This article
Other articles
Peer reviewers 
0
2.4

Reviewer profiles  N/A

Author statements

Author statements
This article
Other articles
Data availability 
N/A
16%
External funding 
N/A
32%
Competing interests 
N/A
11%
Metric
This journal
Other journals
Articles accepted 
4%
33%
Days to publication 
4161
145

Indexed in

    —
Editor & editorial board
profiles
Academic society 
N/A
Publisher 
UMA Editorial. Universidad de Málaga

Downloads

Published

2012-12-31

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. Retrieved from https://www.revistas.uma.es/index.php/recta/article/view/19976

Issue

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

Section

Artículos

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.