Abstract:
|
This paper focuses on cooperative games with transferable utility. We propose the
computation of two solutions, the Shapley value for n agents and the nucleolus with a
maximum of four agents. 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 and the random arrival rules.
Keywords: Cooperative game, Shapley value, nucleolus, claims problem, claims rule, bankruptcy. |