Fixed Tree Games with Repeated Players

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.Moreover, we prove that the core of an FRP game coincides with the core of a related concave fixed tree game.We show how to find the nucleolus and we characterize the orders which provide marginal vectors in the core of an FRP game.