메뉴 건너뛰기




Volumn , Issue , 2011, Pages 273-279

Security games with multiple attacker resources

Author keywords

[No Author keywords available]

Indexed keywords

GAME-THEORETIC; MIXED STRATEGY; MULTIPLE TARGETS; NASH EQUILIBRIA; POLYNOMIAL-TIME ALGORITHMS; SECURITY APPLICATION; SECURITY GAMES; STACKELBERG MODEL;

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

References (9)
  • 5
    • 84899919065 scopus 로고    scopus 로고
    • Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games
    • Estoril, Portugal
    • P. Paruchuri, J. P. Pearce, J. Marecki, M. Tambe, F. Ordóñ ez, and S. Kraus. Playing games for security: An efficient exact algorithm for solving Bayesian Stackelberg games. In AAMAS, pages 895-902, Estoril, Portugal, 2008.
    • (2008) AAMAS , pp. 895-902
    • Paruchuri, P.1    Pearce, J.P.2    Marecki, J.3    Tambe, M.4    Ordóñez, F.5    Kraus, S.6
  • 8
  • 9
    • 80053434424 scopus 로고    scopus 로고
    • Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness
    • Toronto, Canada
    • Z. Yin, D. Korzhyk, C. Kiekintveld, V. Conitzer, and M. Tambe. Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness. In AAMAS, pages 1139-1146, Toronto, Canada, 2010.
    • (2010) AAMAS , pp. 1139-1146
    • Yin, Z.1    Korzhyk, D.2    Kiekintveld, C.3    Conitzer, V.4    Tambe, M.5


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