The Core of Directed Network Problems with Quotas
Somdeb Lahiri
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.
Create a lesson
Related papers
A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities
Dimitris Fotakis, Charalampos Platanos, Thanos Tolias
Faster Verification of PJR+ via Mincuts
Drew Springham
Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
Lishang Xu, Guodong Ma, Pengcheng Weng et al.
A Logarithmic Regret Bound for Optimistic Hedge in General-Sum Games
Junsoo Ha
Condorcet-type properties of the linear ordering problem with ties
Daichi Kawashima, Noriyoshi Sukegawa
On Periodic and Aperiodic Optimal Strategies in Solvency Games
Quentin Guilmant, Florian Luca, Richard Mayr et al.