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 with the root.In this paper we show that FRP games are balanced …

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in … combinations of one and two person coalitions.Secondly it is shown that MLTS games with ¯ve or less players have a nonempty core …

object is owned by a different agent, Shapley and Shubik (1972) introduced a class of assignment games arising from these … simple assignment games and relaxations that arise from assignment situations with multiple ownership.First, necessary and ….Second, balancedness results are obtained for relaxations of simple assignment games. …

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and … the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there … paper we present a polynomially bounded algorithm of order p2 for calculating the nucleolus of neighbour games. …

highway problems and the corresponding cooperative cost games called high- way games to address the problem of fair allocation … balancedness of highway games on more general graphs. A graph G is called highway-game concave if for each highway problem in which … defined on cyclic graphs such that the corresponding highway games are balanced. …

Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can … obtain a positive gain. As a consequence, the class of neighbour games is the intersection of the class of assignment games … (Shapley and Shubik (1972)) and the class of component additive games (Curiel et al. (1994)). We first present some elementary …

associated RP sequencing games.Moreover, it is seen that min-RP sequencing games are convex. …

We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy …

games arising from these sequencing situations.Our main result is balancedness of these games. …