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 …

Weak Sequential Core and their characterization result. We also provide the remedy, a modification of the definition, to …

introduce the concept of core in games with externalities. We show that different assumptions on the behaviour as well as on the … timing of the coalitions of firms yield very di¤erent results on the set of allocations which are core-stable. We then …

This paper proposes two generalization of the core and evaluates them on experimental data of assignment games (workers …-cooperative games, and they prove to be both descriptive and predictive in the assignment games analyzed here. The "logit core" allows …

sell-side). This simple and intuitive learning process implements core allocations even though agents have no knowledge of …

modifications of the Shapley value. We axiomatically characterize these two solutions and study their relation to the strong core …

having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of $k …$-additivity, we define the so-called $k$-balanced games and the corresponding generalization of core, the $k$-additive core, whose …,$ so that the corresponding $k$-additive core is not empty. For the games in the $k$-additive core, we propose a sharing …

The core of a game v on N, which is the set of additive games φ dominating v such that φ(N)=v(N), is a central notion … and the greedy algorithm. In many cases however, the core is empty, and alternative solutions have to be found. We define … the k-additive core by replacing additive games by k-additive games in the definition of the core, where k-additive games …