Finding nucleolus of flow game

AbstractWe study the algorithmic issues of finding the nucleolus of a flow game. The flow game is a cooperative game defined on a network D=(V,E;ω). The player set is E and the value of a coalition S⊆E is defined as the value of a maximum flow from source to sink in the subnetwork induced by S. We show that the nucleolus of the flow game defined on a simple network (ω(e)=1 for each e∈E) can be computed in polynomial time by a linear program duality approach, settling a twenty-three years old conjecture by Kalai and Zemel. In contrast, we prove that both the computation and the recognition of the nucleolus are $\mathcal{NP}$ -hard for flow games with general capacity.

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  Toshihide Ibaraki,et al.  Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..

[3]  Rodica Branzei,et al.  Strongly essential coalitions and the nucleolus of peer group games , 2005, Int. J. Game Theory.

[4]  A. Kopelowitz.  COMPUTATION OF THE KERNELS OF SIMPLE GAMES AND THE NUCLEOLUS OF N-PERSON GAMES. , 1967 .

[5]  Jeroen Kuipers,et al.  Note Computing the nucleolus of min-cost spanning tree games is NP-hard , 1998, Int. J. Game Theory.

[6]  Jeroen Kuipers,et al.  On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.

[7]  Jean Lemaire,et al.  An Application of Game Theory: Cost Allocation , 1984, ASTIN Bulletin.

[8]  Eitan Zemel,et al.  Generalized Network Problems Yielding Totally Balanced Games , 1982, Oper. Res..

[9]  Ulrich Faigle,et al.  Partition games and the core of hierarchically convex cost games , 1995 .

[10]  E. Kohlberg.  On the Nucleolus of a Characteristic Function Game , 1971 .

[11]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[12]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[13]  Martin Skutella,et al.  Cooperative facility location games , 2000, SODA '00.

[14]  Alvin E. Roth,et al.  The assignment game , 1990 .

[15]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[16]  T. Raghavan,et al.  An algorithm for finding the nucleolus of assignment games , 1994 .

[17]  R. Aumann,et al.  Game theoretic analysis of a bankruptcy problem from the Talmud , 1985 .

[18]  Guillermo Owen,et al.  On the core of linear production games , 1975, Math. Program..

[19]  Daniel Granot,et al.  Characterization sets for the nucleolus , 1998, Int. J. Game Theory.

[20]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[21]  J.A.M. Potters,et al.  The nucleolus of balanced simple flow networks , 2006, Games Econ. Behav..

[22]  Daniël Paulusma,et al.  Matching Games: The Least Core and the Nucleolus , 2003, Math. Oper. Res..

[23]  G. Owen,et al.  The kernel/nucleolus of a standard tree game , 1996 .

[24]  Gur Huberman,et al.  The nucleolus and the essential coalitions , 1980 .

[25]  Eitan Zemel,et al.  Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..

[26]  Xiaotie Deng,et al.  On computational complexity of membership test in flow games and linear production games , 2002, Int. J. Game Theory.

[27]  Nimrod Megiddo,et al.  Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[28]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[29]  Xiaotie Deng,et al.  Membership for Core of LP Games and Other Games , 2001, COCOON.

[30]  Jeroen Kuipers,et al.  Computing the nucleolus of some combinatorially-structured games , 2000, Math. Program..