Membership for core of LP games and other games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 247-256

  Fang, Qizhi ^a   Zhu, Shanfeng ^b   Cai, Maocheng ^c   Deng, Xiaotie ^b  

^a OCEAN UNIVERSITY OF CHINA   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Cooperative game; Core; Linear programming; Network flow; NP completeness; Steiner tree

Indexed keywords

COMBINATORIAL MATHEMATICS; GAME THEORY; POLYNOMIAL APPROXIMATION;

COOPERATIVE GAME; CORE; NETWORK FLOWS; NP-COMPLETENESS; STEINER TREES;

LINEAR PROGRAMMING;

EID: 33244472766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_27     Document Type: Conference Paper

References (13)

1. I.J. Curiel (1988), Cooperative Game Theory and Applications. Ph.D. dissertation, University of Nijmegen, the Netherlands.
2. X. Deng, T. Ibaraki and H. Nagamochi (1999), Algorithmic aspects of the core of combinatorial optimization games. Mathematics of Operations Research 24, pp. 751–766.
3. X. Deng, T. Ibaraki, H. Nagamochi and W. Zang (2000),Totally balanced combinatorial optimization games, Mathematical Programming 87, pp.441-452.
4. X. Deng and C.H. Papadimitriou (1994), On the complexity of cooperative solution concepts. Mathematics of Operations Research 19, pp. 257–266.
5. U. Faigle, W. Kern, S.P. Fekete and W. Hochstattler (1997), On the complexity of testing membership in the core of min-cost spanning tree games. International Journal of Game Theory 26, pp. 361–366.
6. M.R. Garey and D.S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco.
7. M.X. Goemans and M. Skutella (2000), Cooperative facility location games. SODA.
8. D. Granot and G. Huberman (1981), Minimum cost spanning tree games. Mathematical Programming 21, pp. 1–18.
9. E. Kalai and E. Zemel (1982), Totally balanced games and games of flow. Mathematics of Operations Research 7, pp. 476–478.
10. E. Kalai and E. Zemel (1982), Generalized network problems yielding totally balanced games. Operations Research 30, pp. 498–1008.
11. N. Megiddo (1978), Computational complexity and the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3, pp. 189–196.
12. G. Owen (1975), On the core of linear production games. Mathematical Programming 9, pp. 358–370.
13. L.S. Shapley (1967), On balanced sets and cores. Naval Research Logistics Quarterly 14, pp. 453–460.