Algorithmic Aspects of the Core of Combinatorial Optimization Games

We discuss an integer programming formulation for a class of cooperative games. We focus on algorithmic aspects of the core, one of the most important solution concepts in cooperative game theory. Central to our study is a simple but very useful observation that the core for this class is nonempty if and only if an associated linear program has an integer optimal solution. Based on this, we study the computational complexity and algorithms to answer important questions about the cores of various games on graphs, such as maximum flow, connectivity, maximum matching, minimum vertex cover, minimum edge cover, maximum independent set, and minimum coloring.

[1]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[2]  P. Hall.  On Representatives of Subsets , 1935 .

[3]  Arie Tamir,et al.  On the Core of Cost Allocation Games Defined on Location Problems , 1993, Transp. Sci..

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

[5]  Pradeep Dubey,et al.  Totally balanced games arising from controlled programming problems , 1984, Math. Program..

[6]  Herbert E. Scarf,et al.  A LIMIT THEOREM ON THE CORE OF AN ECONOMY , 1963, Classics in Game Theory.

[7]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[8]  Daniel Granot,et al.  A generalized linear production model: A unifying model , 1986, Math. Program..

[9]  Xiaotie Deng.  Combinatorial optimization games , 1997, SODA '97.

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

[11]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

[13]  M. Padberg.  Linear Optimization and Extensions , 1995 .

[14]  Lloyd S. Shapley,et al.  On balanced sets and cores , 1967 .

[15]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

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

[18]  Ulrich Faigle,et al.  On the core of ordered submodular cost games , 2000, Math. Program..

[19]  Martin Shubik,et al.  Game theory models and methods in political economy , 1977 .

[20]  Toshihide Ibaraki,et al.  Complexity of the Minimum Base Game on Matroids , 1997, Math. Oper. Res..

[21]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

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

[23]  Martin Shubik,et al.  The Assignment Game , 1971 .