This paper starts from a classical fair division situation of allocating an object among a set of agents. The problem is studied from both a cooperative and a bankruptcy point of view, analyzing the fairness properties of the proposed solutions.

Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization...