The Core of Directed Network Problems with Quotas
Abstract
Description
This paper proves the existence of non-empty cores for directed network problems with quotas and for those combinatorial allocation problems which permit only exclusive allocations.
6 pages, 0 figures, source file: MS Word; definitions of the feasible allocations have been strengthened; examples provided; network obtained by the procedure can be decentralized
6 pages, 0 figures, source file: MS Word; definitions of the feasible allocations have been strengthened; examples provided; network obtained by the procedure can be decentralized