Abstract
We use polynomial formulations to show that several rational and discrete network synthesis games, including the minimum cost spanning tree game, satisfy the assumptions of Owen's linear production game model. We also discuss computational issues related to finding and recognizing core points for these classes of games.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
G.C. Bird, “On cost allocation for a spanning tree: A game theory approach,”Networks 6 (1976) 335–350.
V. Chvátal, “Rational behavior and computational complexity,” Technical Report SOCS-78.9, School of Computer Science, McGill University (Montreal, 1978).
A. Claus and D. Granot, “Game theory application to cost allocation for a spanning tree,” Working Paper No. 402, Faculty of Commerce and Business Administration, University of British Columbia (Vancouver, 1976).
A. Claus and D.J. Kleitman, “Cost allocation for a spanning tree,”Networks 3 (1973) 289–304.
J. Edmonds, “Optimum branchings,”Journal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics 71B (1967) 233–240.
J. Edmonds, “Edge disjoint branchings,” in: B. Rustin, ed.,Combinatorial Algorithms (Academic Press, New York, 1973) pp. 91–96.
J. Edmonds and R. Giles, “A min-max relation for submodular functions on graphs,”Annals of Discrete Mathematics 1 (1977) 185–204.
D.R. Fulkerson, “Packing rooted directed cuts in a weighted directed graph,”Mathematical Programming 6 (1974) 1–13.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
R.E. Gomory and T.C. Hu, “An application of generalized linear programming to network flows,”Journal of the Society for Industrial and Applied Mathematics 10 (1962) 260–283.
R.E. Gomory and T.C. Hu, “Synthesis of a communication network,”Journal of the Society for Industrial and Applied Mathematics 12 (1964) 348–369.
D. Granot, “A generalized linear production model: A unifying model,”Mathematical Programming 34 (1986) 212–222.
D. Granot and F. Granot, “A fixed-cost spanning forest problem,”Networks 20 (1990) 209–229.
D. Granot and M. Hojati, “On cost allocation in communication networks,” Working Paper, Faculty of Commerce and Business Administration, University of British Columbia (Vancouver, 1987).
D. Granot and G. Huberman, “Minimum cost spanning tree games,”Mathematical Programming 21 (1981) 1–18.
D. Granot and G. Huberman, “On the core and nucleolus of M.C.S.T. games,”Mathematical Programming 29 (1984) 323–347.
M. Grötschel, L. Lovasz and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197. [Corrigendum:Combinatorica 4 (1984) 291–295.]
E. Kalai and E. Zemel, “Totally balanced games and games of flows,”Mathematics of Operations Research 7 (1982) 476–478.
E. Kalai and E. Zemel, “Generalized network problems yielding totally balanced games,”Operations Research 30 (1982) 998–1008.
A. Kolen and A. Tamir, “Covering problems,” in: R. L. Francis and P. Mirchandani, eds.,Discrete Location Theory (Wiley, New York, 1990).
M. Maschler, B. Peleg and L.S. Shapley, “The kernel and bargaining set for convex games,”International Journal of Game Theory 1 (1972) 73–93.
N. Megiddo, “Cost allocation for Steiner trees,”Networks 8 (1978) 1–6.
N. Megiddo, “Computational complexity and the game theory approach to cost allocation for a tree,”Mathematics of Operations Research 3 (1978) 189–196.
G. Owen, “On the core of linear production games,”Mathematical Programming 9 (1975) 358–370.
J.A.M. Potters, I.J. Curiel and S.H. Tijs, “Traveling salesman games,” Technical Report, Catholic University Nijmegen (Nijmegen, 1987).
A. Prodon, T.M. Liebling and H. Gröflin, “Steiner's problem on two-trees,” Working Paper RO 850315, Départment de Mathemátiques, EPF Lausanne (Lausanne, 1985).
L.S. Shapley, and M. Shubik, “The assignment game; I. The core,”International Journal of Game Theory 1 (1972) 111–130.
A. Tamir, “On the core of cost allocation games defined on location problems,” Department of Statistics, Tel Aviv University (Tel Aviv, 1980).
A. Tamir, “On the core of a traveling salesman cost allocation game,”Operations Research Letters 8 (1989) 31–34.
R.T. Wong, “A dual ascent approach for Steiner tree problems on a directed graph,”Mathematical Programming 28 (1984) 271–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tamir, A. On the core of network synthesis games. Mathematical Programming 50, 123–135 (1991). https://doi.org/10.1007/BF01594930
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01594930