2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32314This 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 decentralizedComputer Science and Game Theorytext