The Core of Directed Network Problems with Quotas
Somdeb Lahiri
TL;DR
This paper establishes the existence of non-empty cores in directed network problems with quotas and exclusive allocation problems, providing theoretical guarantees for these classes of combinatorial allocation issues.
Contribution
It introduces new existence results for cores in directed network problems with quotas and exclusive allocations, expanding theoretical understanding.
Findings
Proves non-empty cores exist in directed network problems with quotas.
Shows core existence in exclusive allocation combinatorial problems.
Provides foundational theoretical results for these classes.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Voting Systems · Complexity and Algorithms in Graphs · Advanced Graph Theory Research