-convexity, under which the game is shown to have a non-empty core and the average tree solution lies in the core. In general, link …

service that generates the revenues. We focus on the study of the core of cost-revenue games. Under the assumption that … shown that a cost-revenue game has a non-empty core for any vector of revenues if, and only if, the dual game of the cost … game has a large core. Using this result, we investigate minimum cost spanning tree games with revenues. We show that if …

ones. We then define the balanced-core as a refinement ofthe core. A payoff vector lies in the balanced-core if it lies in … the core andthe payoff vector is an element of payoff sets of all graphs in some balanced collection ofgraphs. We prove … that any balanced graph game has a nonempty balanced-core.We conclude by some examples showing the usefulness of the …

-180. In this paper we provide three new characterizations of largeness of the core. The first characterization of largeness of … the core is based on minimal covers of the grand coalition and associated inequalities. The second characterization shows … the relation between the bases that provide core elements of the game and the bases that provide core elements of the …

Harsanyi set is related to the Core and Weberset. We also characterize the Harsanyi mapping as the unique mappingsatisfying a …

nonnegative), and there is some hierarchical ordering of the players. In this paper we introduce the 'Restricted Core' for such … of the players. For totally positive games this solution is always contained in the 'Core', and contains the well … coalitions). For special orderings it equals the Core, respectively Shapley value. We provide an axiomatization and apply this …

coalitions also their union is feasible. Properties of solutions (the core, the nucleolus, the prekernel and the Shapley value …

, these results state already that the set of Harsanyi payoff vectors is given by the core of an associated convex game, a …