메뉴 건너뛰기




Volumn 127, Issue 3, 2003, Pages 555-563

Total balancedness condition for Steiner tree games

Author keywords

Cooperative game; Core; NP hard; Steiner tree; Total balancedness

Indexed keywords


EID: 84867926570     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00388-8     Document Type: Article
Times cited : (3)

References (17)
  • 1
    • 84981618294 scopus 로고
    • On cost allocation for a spanning tree a game theory approach
    • G.C. Bird On cost allocation for a spanning tree a game theory approach Networks 6 1976 335 350
    • (1976) Networks , vol.6 , pp. 335-350
    • Bird, G.C.1
  • 2
    • 0001250954 scopus 로고
    • Some applications of linear programming methods to the theory of cooperative games
    • in Russian
    • O.N. Bondareva Some applications of linear programming methods to the theory of cooperative games Problemy Kibernetiki 10 1963 119 139 in Russian
    • (1963) Problemy Kibernetiki , vol.10 , pp. 119-139
    • Bondareva, O.N.1
  • 4
    • 0037636905 scopus 로고    scopus 로고
    • Combinatorial optimization and coalition games
    • D. Du, P.M. Pardalos, Kluwer Academic Publishers Boston, MA
    • X. Deng Combinatorial optimization and coalition games D. Du, P.M. Pardalos, Handbook of Combinatorial Optimization Vol. 2 1998 Kluwer Academic Publishers Boston, MA 77 103
    • (1998) Handbook of Combinatorial Optimization , vol.2 VOL. , pp. 77-103
    • Deng, X.1
  • 5
    • 0033358883 scopus 로고    scopus 로고
    • Algorithmic aspects of the core of combinatorial optimization games
    • X. Deng, T. Ibaraki, and H. Nagamochi Algorithmic aspects of the core of combinatorial optimization games Math. Oper. Res. 24 1999 751 766
    • (1999) Math. Oper. Res. , vol.24 , pp. 751-766
    • Deng, X.1    Ibaraki, T.2    Nagamochi, H.3
  • 7
    • 0000138929 scopus 로고
    • On the complexity of cooperative solution concepts
    • X. Deng, and C.H. Papadimitriou On the complexity of cooperative solution concepts Math. Oper. Res. 19 1994 257 266
    • (1994) Math. Oper. Res. , vol.19 , pp. 257-266
    • Deng, X.1    Papadimitriou, C.H.2
  • 8
    • 0031520081 scopus 로고    scopus 로고
    • On the complexity of testing membership in the core of min-cost spanning tree games
    • U. Faigle, W. Kern, S.P. Fekete, and W. Hochstättler On the complexity of testing membership in the core of min-cost spanning tree games Int. J. Game Theory 26 1997 361 366
    • (1997) Int. J. Game Theory , vol.26 , pp. 361-366
    • Faigle, U.1    Kern, W.2    Fekete, S.P.3    Hochstättler, W.4
  • 11
    • 0019587745 scopus 로고
    • Minimum cost spanning tree games
    • D. Granot, and G. Huberman Minimum cost spanning tree games Math. Programming 21 1981 1 18
    • (1981) Math. Programming , vol.21 , pp. 1-18
    • Granot, D.1    Huberman, G.2
  • 13
    • 0001642246 scopus 로고
    • Totally balanced games and games of flow
    • E. Kalai, and E. Zemel Totally balanced games and games of flow Math. Oper. Res. 7 1982 476 478
    • (1982) Math. Oper. Res. , vol.7 , pp. 476-478
    • Kalai, E.1    Zemel, E.2
  • 14
    • 0017938032 scopus 로고
    • Cost allocation for Steiner trees
    • N. Megiddo Cost allocation for Steiner trees Networks 8 1978 1 6
    • (1978) Networks , vol.8 , pp. 1-6
    • Megiddo, N.1
  • 15
    • 0016594972 scopus 로고
    • On the core of linear production games
    • G. Owen On the core of linear production games Math. Programming 9 1975 358 370
    • (1975) Math. Programming , vol.9 , pp. 358-370
    • Owen, G.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.