메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Regret minimization in games with incomplete information

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; GAME THEORY;

EID: 85162042235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (595)

References (9)
  • 1
    • 0000979731 scopus 로고
    • The complexity of two-person zero-sum games in extensive form
    • D. Koller and N. Megiddo. The complexity of two-person zero-sum games in extensive form. Games and Economic Behavior, pages 528-552, 1992.
    • (1992) Games and Economic Behavior , pp. 528-552
    • Koller, D.1    Megiddo, N.2
  • 4
    • 33750796083 scopus 로고    scopus 로고
    • A competitive texas hold'em poker player via automated abstraction and real-time equilibrium computation
    • A. Gilpin and T. Sandholm. A competitive texas hold'em poker player via automated abstraction and real-time equilibrium computation. In National Conference on Artificial Intelligence, 2006.
    • (2006) National Conference on Artificial Intelligence
    • Gilpin, A.1    Sandholm, T.2


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