arXiv Analytics

Sign in

arXiv:1901.00860 [math.CO]AbstractReferencesReviewsResources

On Decomposition of Solutions for Coalitional Games

Tomáš Kroupa

Published 2019-01-03Version 1

A solution concept on a class of transferable utility coalitional games is a multifunction satisfying given criteria of economic rationality. Every solution associates a set of payoff allocations with a coalitional game. This general definition specializes to a number of well-known concepts such as the core, Shapley value, nucleolus etc. In this note it is shown that in many cases a solution factors through a set of games whose members can be viewed as elementary building blocks for the solution. Two factoring maps have a very simply structure. The first decomposes a game into its elementary components and the second one combines the output of the first map into the respective solution outcome. The decomposition is then studied mainly for certain polyhedral cones of zero-normalized games.

Related articles: Most relevant | Search more
arXiv:2305.09192 [math.CO] (Published 2023-05-16)
Decomposition of (infinite) digraphs along directed 1-separations
arXiv:math/0512291 [math.CO] (Published 2005-12-13, updated 2006-01-10)
Some bounds on convex combinations of $ω$ and $χ$ for decompositions into many parts
arXiv:1910.06385 [math.CO] (Published 2019-10-14)
Decomposition of tripartite graphs into 5-cycles; A review and some more results