메뉴 건너뛰기
International Journal of Game Theory
Volumn 25, Issue 2, 1996, Pages 219-244
The kernel/nucleolus of a standard tree game
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0030553803     PISSN: 00207276     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01247104     Document Type: Article
Times cited : (52)
References (16)
  • 1
    • 84981618294 scopus 로고
    • On cost allocation for a spanning tree: A game theoretic approach
    • Bird CG (1976) On cost allocation for a spanning tree: A game theoretic approach. Networks 6: 335-350
    • (1976) Networks , vol.6 , pp. 335-350
    • Bird, C.G.1
  • 2
    • 0039767974 scopus 로고
    • Game theory application to cost allocation for a spanning tree
    • Faculty of Commerce and Business Administration, University of British Columbia, Vancouver
    • Claus A, Granot D (1976) Game theory application to cost allocation for a spanning tree. Working paper 402. Faculty of Commerce and Business Administration, University of British Columbia, Vancouver
    • (1976) Working Paper , vol.402
    • Claus, A.1    Granot, D.2
  • 3
    • 0018925214 scopus 로고
    • Applications of efficient mergeable heaps for optimization problems on trees
    • Galil Z (1980) Applications of efficient mergeable heaps for optimization problems on trees. Acta Informatica 13: 53-58
    • (1980) Acta Informatica , vol.13 , pp. 53-58
    • Galil, Z.1
  • 4
    • 0001072138 scopus 로고
    • Computational complexity of a cost allocation approach to a fixed cost spanning forest problem
    • Granot D, Granot F (1992) Computational complexity of a cost allocation approach to a fixed cost spanning forest problem. Mathematics of Operations Research 17: 765-780
    • (1992) Mathematics of Operations Research , vol.17 , pp. 765-780
    • Granot, D.1    Granot, F.2
  • 6
    • 0021481985 scopus 로고
    • On the core and nucleolus of minimum cost spanning tree games
    • Granot D, Huberman G (1984) On the core and nucleolus of minimum cost spanning tree games. Mathematical Programming 29: 323-347
    • (1984) Mathematical Programming , vol.29 , pp. 323-347
    • Granot, D.1    Huberman, G.2
  • 7
    • 0039767975 scopus 로고
    • Spanning network games
    • Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, BC, Canada
    • Granot D, Maschler M (1994) Spanning network games. Working paper, Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, BC, Canada.
    • (1994) Working Paper
    • Granot, D.1    Maschler, M.2
  • 8
    • 0002796762 scopus 로고
    • A simple expression for the nucleolus in a special case
    • Littlechild SC (1974) A simple expression for the nucleolus in a special case. International Journal of Game Theory 3:21-29
    • (1974) International Journal of Game Theory , vol.3 , pp. 21-29
    • Littlechild, S.C.1
  • 11
    • 70350090816 scopus 로고
    • The bargaining set, kernel, and nucleolus
    • Aumann RJ, Hart S (eds). Elsevier Science Publishers B.V. Amsterdam North Holland
    • Maschler M (1992) The bargaining set, kernel, and nucleolus. In: Aumann RJ, Hart S (eds). Handbook of Game Theory. Vol. I. Elsevier Science Publishers B.V. Amsterdam North Holland 591-667
    • (1992) Handbook of Game Theory , vol.1 , pp. 591-667
    • Maschler, M.1
  • 14
    • 0000928347 scopus 로고
    • Computational complexity of the game theory approach to cost allocation for a tree
    • Megiddo N (1978) Computational complexity of the game theory approach to cost allocation for a tree. Mathematics of Operations Research 3: 189-196
    • (1978) Mathematics of Operations Research , vol.3 , pp. 189-196
    • Megiddo, N.1
  • 15
    • 33947201443 scopus 로고
    • On the reduced game property and its converse
    • Peleg B (1986) On the reduced game property and its converse. International Journal of Game Theory 15: 187-200
    • (1986) International Journal of Game Theory , vol.15 , pp. 187-200
    • Peleg, B.1

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