메뉴 건너뛰기




Volumn 1, Issue , 2009, Pages 268-275

Hedonic coalition nets

Author keywords

Complexity; Hedonic games; Marginal contribution nets

Indexed keywords

COMPLEX NETWORKS; GAME THEORY; KNOWLEDGE REPRESENTATION; MULTI AGENT SYSTEMS;

EID: 84899786667     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (64)

References (15)
  • 1
    • 4344563976 scopus 로고    scopus 로고
    • NP-completeness in hedonic games
    • C. Ballester. NP-completeness in hedonic games. Games and Econ. Beh., 49:1-30, 2004.
    • (2004) Games and Econ. Beh. , vol.49 , pp. 1-30
    • Ballester, C.1
  • 3
    • 0002540033 scopus 로고    scopus 로고
    • Tree width: Algorithmic techniques and results
    • H. L. Bodlaender. Tree width: Algorithmic techniques and results. In Proc. MFCS, 1997.
    • (1997) Proc. MFCS
    • Bodlaender, H.L.1
  • 4
    • 0036167357 scopus 로고    scopus 로고
    • The stability of hedonic coalition structures
    • A. Bogomolnaia and M. O. Jackson. The stability of hedonic coalition structures. Games and Econ. Beh., 38:201-230, 2002.
    • (2002) Games and Econ. Beh. , vol.38 , pp. 201-230
    • Bogomolnaia, A.1    Jackson, M.O.2
  • 5
    • 0038460140 scopus 로고    scopus 로고
    • Computational complexity of stable partitions with B-preferences
    • K. Cechlarova and J. Hajdukova. Computational complexity of stable partitions with B-preferences. Int. Jnl of Game Th., 31(3):353-364, 2002.
    • (2002) Int. Jnl of Game Th. , vol.31 , Issue.3 , pp. 353-364
    • Cechlarova, K.1    Hajdukova, J.2
  • 6
    • 1642601804 scopus 로고    scopus 로고
    • Stable partitions with B-preferences
    • K. Cechlarova and J. Hajdukova. Stable partitions with B-preferences. Discrete App. Math., 138:333-347, 2004.
    • (2004) Discrete App. Math. , vol.138 , pp. 333-347
    • Cechlarova, K.1    Hajdukova, J.2
  • 13
    • 70450121636 scopus 로고    scopus 로고
    • Infeasibility certificates and the complexity of the core in coalitional games
    • E. Malizia, L. Palopoli, and F. Scarcello. Infeasibility certificates and the complexity of the core in coalitional games. In Proc. IJCAI-07, 2007.
    • (2007) Proc. IJCAI-07
    • Malizia, E.1    Palopoli, L.2    Scarcello, F.3
  • 14
    • 84899802239 scopus 로고    scopus 로고
    • Nash stability in additively separable hedonic games is NP-hard
    • M. Olsen. Nash stability in additively separable hedonic games is NP-hard. In Proc. CiE-07, 2007.
    • (2007) Proc. CiE-07
    • Olsen, M.1
  • 15
    • 33847016487 scopus 로고    scopus 로고
    • On core membership testing for hedonic coalition formation games
    • S. C. Sung and D. Dimitrov. On core membership testing for hedonic coalition formation games. Oper. Res. Letters, 35:155-158, 2007.
    • (2007) Oper. Res. Letters , vol.35 , pp. 155-158
    • Sung, S.C.1    Dimitrov, D.2


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