A coloring property for stable allocations

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.