Algorithmic aspects of the core of combinatorial optimization games

Mathematics of Operations Research

Volumn 24, Issue 3, 1999, Pages 751-766

  Deng, Xiaotie ^a   Ibaraki, Toshihide ^b   Nagamochi, Hiroshi ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; GAME THEORY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; THEOREM PROVING;

ALGORITHMIC ASPECTS; COMBINATORIAL OPTIMIZATION GAMES; COOPERATIVE GAMES;

OPERATIONS RESEARCH;

EID: 0033358883     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.24.3.751     Document Type: Article

References (23)

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