메뉴 건너뛰기




Volumn , Issue , 2011, Pages 258-265

Accelerating best response calculation in large extensive games

Author keywords

[No Author keywords available]

Indexed keywords

AI TECHNIQUES; BEST RESPONSE; EVALUATION CRITERIA; IMPERFECT INFORMATION GAMES; LARGE GAMES; PARALLEL ENVIRONMENT; TEXAS HOLD'EM; WORST-CASE PERFORMANCE;

EID: 84868271214     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-054     Document Type: Conference Paper
Times cited : (118)

References (8)
  • 3
    • 77953115320 scopus 로고    scopus 로고
    • Smoothing techniques for computing nash equilibria of sequential games
    • Samid Hoda, Andrew Gilpin, Javier Peña, and Tuomas Sandholm. Smoothing techniques for computing nash equilibria of sequential games. Mathematics of Operations Research, 35(2):494-512, 2010.
    • (2010) Mathematics of Operations Research , vol.35 , Issue.2 , pp. 494-512
    • Hoda, S.1    Gilpin, A.2    Peña, J.3    Sandholm, T.4
  • 4
    • 84881051104 scopus 로고    scopus 로고
    • Win rate with optimal strategy against limit raise bot
    • mykey1961. retrieved April 14, 2011
    • mykey1961. Win rate with optimal strategy against limit raise bot. Two Plus Two Poker Forums, September 2007. http://forumserver.twoplustwo.com/15/ poker-theory/win-rate-optimal-strategy-against-limit-raise-bot-2332/index6.html\ #post251612, retrieved April 14, 2011.
    • Two Plus Two Poker Forums, September 2007


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