Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games

In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1). We show that a uniform flow game has a stable core if and only if the network is a balanced DAG (for all non-terminal vertices, indegree equals outdegree), which can be decided in linear time. Then we show that uniform flow games are exact, extendable, and have a large core if and only if the network is a balanced directed series-parallel graph, which again can be decided in linear time.

• Type: Conference
• Year: 2007
• Where: COCOON
• Authors: Qizhi Fang, Rudolf Fleischer, Jian Li, Xiaoxun Sun
• Keywords: COCOON 2007, Linear Time, Uniform flow Games, flow Games