We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games...

We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games...

We introduce and compare several coalition values for multichoice games. Albizuri defined coalition structures and an extension of the Owen coalition value for multichoice games using the average marginal contribution of a player over a set of orderings of the player’s representatives....

We introduce and compare several coalition values for multichoice games. Albizuri defined coalition structures and an extension of the Owen coalition value for multichoice games using the average marginal contribution of a player over a set of orderings of the player’s representatives....

We explore the relationship between proportionality and manipulation (via merging or splitting agents' claims) in bankruptcy problems. We provide an alternative proof to the well-known result that, in an unrestricted domain, immunity to manipulation is equivalent to requiring proportional...

In this study, we provide a new solution for cooperative games with coalition structures. The collective value of a player is defined as the sum of the equal division of the pure surplus obtained by his coalition from the coalitional bargaining and of his Shapley value for the internal...

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

We consider an extension of minimum cost spanning tree (mcst) problems in which some agents do not need to be connected to the source, but might reduce the cost of others to do so. Even if the cost usually cannot be computed in polynomial time, we extend the characterization of the Kar solution...