We investigate assignment of heterogeneous agents in trees where the allocation rule is given by the permission value. We focus on efficient hierarchies,namely those, for which the payoff of the top agent is maximized. For additive games, such hierarchies are always cogent, namely, more...

In chapter 1, we consider the possibility of Secure Implementation in Production Economies beyond the result provided in the Saijo et al. (2007) paper. We find a large class of SCFs to be securely implementable. The serial SCF and the widely studied Fixed Path SCFs which contains serial SCF as a...