메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1402-1407

Infeasibility certificates and the complexity of the core in coalitional games

Author keywords

[No Author keywords available]

Indexed keywords

COALITIONAL GAME; COMPACT REPRESENTATION; EMPTY CORE; MARGINAL CONTRIBUTION; POLYNOMIAL-TIME;

EID: 70450121636     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (13)
  • 4
    • 0003680992 scopus 로고    scopus 로고
    • The Nobel Foundation, Nobel Prize Lecture
    • Robert J. Aumann. War and peace. The Nobel Foundation, 2005. Nobel Prize Lecture.
    • (2005) War and Peace
    • Aumann, R.J.1
  • 5
    • 9644266731 scopus 로고    scopus 로고
    • Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains
    • AAAI-Press
    • Vincent Conitzer and Tuomas Sandholm. Computing shapley values, manipulating value division schemes, and checking core membership in multi-issue domains. AAAI- 04, 219-225, AAAI-Press.
    • AAAI- 04 , pp. 219-225
    • Conitzer, V.1    Sandholm, T.2
  • 6
    • 33645331578 scopus 로고    scopus 로고
    • Complexity of constructing solutions in the core based on synergies among coalitions
    • Vincent Conitzer and Tuomas Sandholm. Complexity of constructing solutions in the core based on synergies among coalitions. AIJ, 170(6-7):607-619, 2006.
    • (2006) AIJ , vol.170 , Issue.6-7 , pp. 607-619
    • Conitzer, V.1    Sandholm, T.2
  • 8
    • 0000138929 scopus 로고
    • On the complexity of cooperative game solution concepts
    • Xiaotie Deng and Christos H. Papadimitriou. On the complexity of cooperative game solution concepts. Mathematics of Operations Research, 19(2):257-266, 1994.
    • (1994) Mathematics of Operations Research , vol.19 , Issue.2 , pp. 257-266
    • Deng, X.1    Papadimitriou, C.H.2
  • 9
    • 0003301331 scopus 로고
    • Convex Polytopes
    • John Wiley & Sons, NY
    • Branko Grünbaum. Convex Polytopes, volume XVI of Pure and Applied Mathematics. John Wiley & Sons, NY, 1967.
    • (1967) Pure and Applied Mathematics , vol.16
    • Grünbaum, B.1
  • 10
    • 30044441223 scopus 로고    scopus 로고
    • Marginal contribution nets: A compact representation scheme for coalitional games
    • Vancouver, Canada, ACM Press
    • Samuel Ieong and Yoav Shoham. Marginal contribution nets: a compact representation scheme for coalitional games. In Proc. of EC ' 05, 193-202, Vancouver, Canada, ACM Press, 2005.
    • (2005) Proc. of EC ' 05 , pp. 193-202
    • Ieong, S.1    Shoham, Y.2
  • 13
    • 0034836562 scopus 로고    scopus 로고
    • Algorithms, games, and the Internet
    • Christos H. Papadimitriou. Algorithms, games, and the Internet. STOC, 2001.
    • (2001) STOC
    • Papadimitriou, C.H.1


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