메뉴 건너뛰기




Volumn 18, Issue 1, 2009, Pages 64-86

Finding nucleolus of flow game

Author keywords

Efficient algorithm; Flow game; Linear program duality; N hard; Nucleolus

Indexed keywords

ALGORITHMIC ISSUES; COOPERATIVE GAME; EFFICIENT ALGORITHM; FLOW GAME; LINEAR PROGRAM DUALITY; LINEAR PROGRAMS; MAXIMUM FLOWS; NUCLEOLUS; POLYNOMIAL-TIME; SIMPLE NETWORKS; SINK-IN; SUB-NETWORK;

EID: 67651114225     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-008-9138-0     Document Type: Article
Times cited : (38)

References (31)
  • 1
    • 0002271922 scopus 로고
    • Game theoretic analysis of a bankruptcy problem from the Talmud
    • RJ Aumann M Maschler 1985 Game theoretic analysis of a bankruptcy problem from the Talmud J Econ Theory 36 195 396
    • (1985) J Econ Theory , vol.36 , pp. 195-396
    • Aumann, R.J.1    Maschler, M.2
  • 3
    • 0000138929 scopus 로고
    • On the complexity of cooperative solution concepts
    • X Deng CH Papadimitriou 1994 On the complexity of cooperative solution concepts Math Oper Res 19 257 266
    • (1994) Math Oper Res , vol.19 , pp. 257-266
    • Deng, X.1    Papadimitriou, C.H.2
  • 4
    • 0033358883 scopus 로고    scopus 로고
    • Algorithmic aspects of the core of combinatorial optimization games
    • X Deng T Ibaraki H Nagamochi 1999 Algorithmic aspects of the core of combinatorial optimization games Math Oper Res 24 751 766 (Pubitemid 30501676)
    • (1999) Mathematics of Operations Research , vol.24 , Issue.3 , pp. 751-766
    • Deng, X.1    Ibaraki, T.2    Nagamochi, H.3
  • 6
    • 0000927535 scopus 로고
    • Paths trees, and flowers
    • J Edmonds 1965 Paths trees, and flowers Can J Math 17 449 467
    • (1965) Can J Math , vol.17 , pp. 449-467
    • Edmonds, J.1
  • 8
    • 0032221794 scopus 로고    scopus 로고
    • Computing the nucleolus of min-cost spanning tree games is NP-hard
    • U Faigle W Kern J Kuipers 1998 Computing the nucleolus of min-cost spanning tree games is NP-hard Int J Game Theory 27 443 450
    • (1998) Int J Game Theory , vol.27 , pp. 443-450
    • Faigle, U.1    Kern, W.2    Kuipers, J.3
  • 9
    • 0035538778 scopus 로고    scopus 로고
    • On the computation of the nucleolus of a cooperative game
    • U Faigle W Kern J Kuipers 2001 On the computation of the nucleolus of a cooperative game Int J Game Theory 30 79 98
    • (2001) Int J Game Theory , vol.30 , pp. 79-98
    • Faigle, U.1    Kern, W.2    Kuipers, J.3
  • 10
    • 0036745726 scopus 로고    scopus 로고
    • On computational complexity of membership test in flow games and linear production games
    • Q Fang S Zhu M Cai X Deng 2002 On computational complexity of membership test in flow games and linear production games Int J Game Theory 31 39 45
    • (2002) Int J Game Theory , vol.31 , pp. 39-45
    • Fang, Q.1    Zhu, S.2    Cai, M.3    Deng, X.4
  • 12
    • 1442313867 scopus 로고    scopus 로고
    • Cooperative facility location games
    • MX Goemans M Skutella 2004 Cooperative facility location games J Algorithms 50 194 214
    • (2004) J Algorithms , vol.50 , pp. 194-214
    • Goemans, M.X.1    Skutella, M.2
  • 16
    • 0002099048 scopus 로고
    • The nucleolus and the essential coalitions
    • Springer Berlin
    • Huberman G (1980) The nucleolus and the essential coalitions. In: Analysis and optimizations of systems. Springer, Berlin, pp 416-422
    • (1980) Analysis and Optimizations of Systems , pp. 416-422
    • Huberman, G.1
  • 17
    • 0001642246 scopus 로고
    • Totally balanced games and games of flow
    • E Kalai E Zemel 1982 Totally balanced games and games of flow Math Oper Res 7 476 478
    • (1982) Math Oper Res , vol.7 , pp. 476-478
    • Kalai, E.1    Zemel, E.2
  • 18
    • 0020182927 scopus 로고
    • Generalized network problems yielding totally balanced games
    • E Kalai E Zemel 1982 Generalized network problems yielding totally balanced games Oper Res 30 498 1008
    • (1982) Oper Res , vol.30 , pp. 498-1008
    • Kalai, E.1    Zemel, E.2
  • 19
    • 0038386374 scopus 로고    scopus 로고
    • Matching games: The least core and the nucleolus
    • W Kern D Paulusma 2003 Matching games: the least core and the nucleolus Math Oper Res 28 294 308
    • (2003) Math Oper Res , vol.28 , pp. 294-308
    • Kern, W.1    Paulusma, D.2
  • 21
    • 0000175419 scopus 로고    scopus 로고
    • Computing the nucleolus of some combinatorially structured games
    • J Kuipers T Solymosi H Aarts 2000 Computing the nucleolus of some combinatorially structured games Math Program 88 541 563
    • (2000) Math Program , vol.88 , pp. 541-563
    • Kuipers, J.1    Solymosi, T.2    Aarts, H.3
  • 22
    • 0042999993 scopus 로고
    • An application of game theory: Cost allocation
    • J Lemaire 1984 An application of game theory: cost allocation ASTIN Bull 14 1 61 81
    • (1984) ASTIN Bull , vol.14 , Issue.1 , pp. 61-81
    • Lemaire, J.1
  • 24
    • 0000928347 scopus 로고
    • Computational complexity and the game theory approach to cost allocation for ta tree
    • N Megiddo 1978 Computational complexity and the game theory approach to cost allocation for ta tree Math Oper Res 3 189 196
    • (1978) Math Oper Res , vol.3 , pp. 189-196
    • Megiddo, N.1
  • 25
    • 0016594972 scopus 로고
    • On the core of linear production games
    • G Owen 1975 On the core of linear production games Math Program 9 358 370
    • (1975) Math Program , vol.9 , pp. 358-370
    • Owen, G.1
  • 26
    • 29944445716 scopus 로고    scopus 로고
    • The nucleolus of balanced simple flow networks
    • DOI 10.1016/j.geb.2004.08.008, PII S0899825604001708
    • J Potters H Reijinierse A Biswas 2006 The nucleolus of balanced simple flow networks Games Econ Behav 54 205 225 (Pubitemid 43040261)
    • (2006) Games and Economic Behavior , vol.54 , Issue.1 , pp. 205-225
    • Potters, J.1    Reijnierse, J.H.2    Biswas, A.3
  • 28
    • 0001202536 scopus 로고
    • The nucleolus of a characteristic function game
    • D Schmeidler 1969 The nucleolus of a characteristic function game SIAM J Appl Math 17 1163 1170
    • (1969) SIAM J Appl Math , vol.17 , pp. 1163-1170
    • Schmeidler, D.1
  • 31
    • 21844484906 scopus 로고
    • An algorithm for finding the nucleolus of assignment games
    • T Solymosi TES Raghavan 1994 An algorithm for finding the nucleolus of assignment games Int J Game Theory 23 119 143
    • (1994) Int J Game Theory , vol.23 , pp. 119-143
    • Solymosi, T.1    Raghavan, T.E.S.2


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