Algorithmic Aspects of the Core of Combinatorial Optimization Games

References

• Debreu G., Scarf H. A limit theorem on the core of an economy. Internat. Econom. Rev. (1963) 4:235–246Crossref, Google Scholar
• Deng X., Papadimitriou C. On the complexity of cooperative game solution concepts. Math. Oper. Res. (1994) 19:257–266Link, Google Scholar
• Deng X., Ibaraki T., Nagamochi H. Combinatorial optimization games. Proc. 8th Ann. ACM-SIAM Sympos. Discrete Algorithms (1997) New Orleans, LA:720–729Google Scholar
• Dubey P., Shapley L. S. Totally balanced games arising from controlled programming problems. Math. Programming (1984) 29:245–267Crossref, Google Scholar
• Edmonds J. Optimum branchings. National Bureau of Standards J. Res. (1967) 69B:125–130Crossref, Google Scholar
• Edmonds J., Rustin R. Edge disjoint branching. Combinatorial Algorithms (1973) (Academic Press, New York) Google Scholar
• Edmonds J., Karp R. M. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM (1972) 19:248–264Crossref, Google Scholar
• Faigle U., Kern W. On the core of ordered submodular cost games. Math. ProgrammingForthcomingGoogle Scholar
• Ford L. R., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-completeness (1979) (W.H. Freeman & Company, Publishers, San Francisco, CA) Google Scholar
• Granot D. A generalized linear production model: A unified model. Math. Programming (1986) 34:212–222Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A.Geometric Algorithms and Combinatorial Optimization (1988) (Springer-Verlag, Tokyo) Crossref, Google Scholar
• Hall P. On representatives of subsets. J. London Math. Soc. (1935) 10:26–30Google Scholar
• Kalai E., Zemel E. Totally balanced games and games of flow. Math. Oper. Res. (1982) 7:476–478Link, Google Scholar
• Megiddo N. Computational complexity and the game theory approach to cost allocation for a tree. Math. Oper. Res. (1978) 3:189–196Link, Google Scholar
• Nagamochi H., Zeng D., Kabutoya N., Ibaraki T. Complexity of the minimum base game on matroids. Math. Oper. Res. (1997) 22:146–164Link, Google Scholar
• Owen G. On the core of linear production games. Math. Programming (1975) 9:358–370Crossref, Google Scholar
• Padberg M.Linear Optimization and Extensions (1995) (Springer, Berlin, Germany) Google Scholar
• Schrijver A.Theory of Linear Integer Programming (1986) (John Wiley, Chichester, UK) Google Scholar
• Shapley L. S. On balanced sets and cores. Naval Res. Logist. Quart. (1967) 14:453–460Crossref, Google Scholar
• Shapley L. S., Shubik M. The assignment game. Internat. J. Game Theory (1972) 1:111–130Crossref, Google Scholar
• Shubik M. Game theory models and methods in political economy. Handbook of Mathematical Economics (1981) I(Arrow,Intriligator, North-Holland, New York) . edited byGoogle Scholar
• Tamir A. On the core of cost allocation games defined on location problems. Preprints, Second Internat. Conf. Locational Decisions (ISOLDE 81) (1981) Skodsborg, Denmark:387–402Google Scholar