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.
Cite
@article{arxiv.cs/0408065,
title = {The Core of Directed Network Problems with Quotas},
author = {Somdeb Lahiri},
journal= {arXiv preprint arXiv:cs/0408065},
year = {2007}
}
Comments
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