A coloring property for stable allocations

Ajdin Halilović and Teodor Ţurcanu

Mathematical Social Sciences, 2016, vol. 80, issue C, 65-69

Abstract: We prove that in the stable allocations problem for a fixed vertex v there can be done a partition of the edges incident with v such that in any stable allocation there is at most one edge incident with v from each class. This is an improvement of the coloring theorem for stable b-matchings given in Fleiner (2003). We also extend our result to stable flows and allocations with choice functions.

Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0165489616000172
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matsoc:v:80:y:2016:i:c:p:65-69

DOI: 10.1016/j.mathsocsci.2016.02.006

Access Statistics for this article

Mathematical Social Sciences is currently edited by J.-F. Laslier

More articles in Mathematical Social Sciences from Elsevier
Bibliographic data for series maintained by Catherine Liu ().