Algorithms for core stability, core largeness, exactness, and extendability of flow games
- First Online:
- Cite this article as:
- Fang, Q., Fleischer, R., Li, J. et al. Front. Math. China (2010) 5: 47. doi:10.1007/s11464-009-0048-y
We study core stability and some related properties of flow games defined on simple networks (all edge capacities are equal) from an algorithmic point of view. We first present a sufficient and necessary condition that can be tested efficiently for a simple flow game to have a stable core. We also prove the equivalence of the properties of core largeness, extendability, and exactness of simple flow games and provide an equivalent graph theoretic characterization which allows us to decide these properties in polynomial time.
KeywordsFlow network series-parallel graph imputation cooperative game
MSC91A12 91A46 05C57
Unable to display preview. Download preview PDF.