This paper introduces fixed tree games with repeated players (FRP games) which are a generalization of standard fixed tree games. This generalization consists in allowing players to be located in more than one vertex. As a consequence, these players can choose among several ways of connection...

Chain-component additive games are graph-restricted superadditive games, where an exogenously given line-graph determines the cooperative possibilities of the players. These games can model various multi-agent decision situations, such as strictly hierarchical organisations or...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue. We assume that the agents collaborate in order to achieve an efficient outcome for society. We allow for side-payments and provide a method for obtaining...