The Core of Directed Network Problems with Quotas
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.
|Date of creation:||Feb 2005|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.feem.it/Email:
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2005.25. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (barbara racah)
If references are entirely missing, you can add them using this form.