Algorithms for core stability, core largeness, exactness, and extendability of flow games (Q2266830): Difference between revisions

In this paper, the authors propose the structural characterization of exact games, extendable games, large core and stable core for simple flow games and obtain the polynomial time algorithms to test these properties. Although it is co-NP-complete to decide whether an imputation belongs to the core, this does not rule out the possibility that core stability can be decided efficiently. They also talk of some open problems.