Abstract (EN)

A Generalized Additive Game (GAG) [9] is a Transferable Utility (TU) game (N, v), where each player in N is provided with an individual value, and the worth v(S) of a coalition S ⊆ N is obtained as the sum of the individual values of players in another subset M(S) ⊆ N. Based on conditions on the map M (which associates to each coalition S a set of beneficial players M(S) not necessarily included in S), in this paper we characterize classes of GAGs that satisfy properties like monotonicity, superadditivity, (total) balancedness, PMAS-admissibility and supermodularity, for all nonnegative vectors of individual values. We also illustrate the application of such conditions on M over particular GAGs studied in the literature (e.g., glove games [24], generalized airport games [20], fixed tree games [4], link-connection games [19, 16], simple minimum cost spanning tree games [21, 27] and graph coloring games [10, 11]).