A discrete mass transportation problem for infinitely many sites, and general representant systems for infinite families

A discrete mass transportation problem, studied by Kellerer, is extended to the case of infinitely many sites. An application to general representant systems is given, which generalizes M. Hall\u27s extension of P. Hall\u27s theorem to the case of infinite families of sets. © Springer-Verlag 2003