Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5775903 | Applied Mathematics and Computation | 2017 | 13 Pages |
Abstract
This paper focuses on cooperative games with transferable utility. We propose the computation of three solutions, the Shapley value for n agents, the nucleolus with a maximum of four agents and the per capita nucleolus. The current approach is also focused on conflicting claims problems, a particular case of coalitional games. We provide the computation of the most well-known and used claims solutions: the proportional, the constrained equal awards, the constrained equal losses, the Talmud, the random arrival and the adjusted proportional rules.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Sebastián Cano-Berlanga, José-Manuel Giménez-Gómez, Cori Vilella,