Generalized Network Problems Yielding Totally Balanced Games

A class of multiperson mathematical optimization problems is considered and is shown to generate cooperative games with nonempty cores. The class includes, but is not restricted to, numerous versions of network flow problems. It was shown by Owen that for games generated by linear programming optimization problems, optimal dual solutions correspond to points in the core. We identify a special class of network flow problems for which the converse is true, i.e., every point in the core corresponds to an optimal dual solution.

[1]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

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

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

[4]  L. Shapley,et al.  ON MARKET GAMES , 1969, Classics in Game Theory.

[5]  D. Schmeidler The Nucleolus of a Characteristic Function Game , 1969 .

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

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

[8]  D. R. Fulkerson,et al.  Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

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

[10]  Gerald L. Thompson,et al.  Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.

[11]  R. Bixby,et al.  Market representations of $n$-person games , 1974 .

[12]  Fred W. Glover,et al.  An improved version of the out-of-kilter method and a comparative study of computer codes , 1974, Math. Program..

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

[14]  T. Ichiishi Towards the General Equilibrium Theory of the Labor-Managed Market Economy , 1975 .

[15]  Gerald G. Brown,et al.  Design and Implementation of Large-Scale Primal Transshipment Algorithms , 1976 .

[16]  Zvi Galil,et al.  A new algorithm for the maximal flow problem , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

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