It is well-known that the prekernel on the class of TU games is uniquely determined by non-emptiness, Pareto efficiency (EFF), covariance under strategic equivalence (COV), the equal treatment property, the reduced game property (RGP), and its converse. We show that the prekernel on the class of TU games restricted to the connected coalitions with respect to communication structures may be axiomatized by suitably generalized axioms. Moreover, it is shown that the prenucleolus, the unique solution concept on the class of TU games that satisfies singlevaluedness, COV, anonymity, and RGP, may be characterized by suitably generalized versions of these axioms together with a property that is called “independence of irrelevant connections”. This property requires that any element of the solution to a game with communication structure is an element of the solution to the game that allows unrestricted cooperation in all connected components, provided that each newly connected coalition is sufficiently charged, i.e., receives a sufficiently small worth. Both characterization results may be extended to games with conference structures.
TU game Solution concept Communication and conference structure Nucleolus Kernel
This is a preview of subscription content, log in to check access.
Shapley LS (1953) A value for n-person games. In: Contribution to the theory of games II, vol 28 of annals of mathematics studies. Princeton University Press, Princeton, NJ, pp 307–317Google Scholar
Sobolev AI (1975) The characterization of optimality principles in cooperative games by functional equations. In: Vorobiev NN (ed) Mathematical methods in the social sciences, vol. 6. Academy of Sciences of the Lithuanian SSR, in Russian, Vilnius, pp 95–151Google Scholar