-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

-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 …

of 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 …

the unique welfare distribution that is core-stable and satisfies the condition that no agent gets a utility payoff above … has an increasing benefit function (no externalities) then every weighted hierarchical solution is core-stable. In case of …

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

shown that the core of a TU-game coincides with the core of the corresponding minimal rights game. Moreover, the paper … introduces the notion of the k-core cover as an extension of the core cover. The k-core cover of a TU-game consists of all … minimal rights game. It is shown that the core of a TU-game with player set N coincides with the L|N |/2-̦core cover …

We examine recent claims that a particular Q-learning algorithm used by competitors 'autonomously' and systematically … detailed analysis of the inner workings of this algorithm reveals that there is no immediate reason for alarm. We set out what … is needed to demonstrate the existence of a colluding price algorithm that does form a threat to competition. …