메뉴 건너뛰기




Volumn WS-11-06, Issue , 2011, Pages 42-48

Linear-time resource allocation in security games with identical fully protective resources

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL INFRASTRUCTURE PROTECTION; OPTIMAL RESOURCE ALLOCATION; SECURITY DOMAINS; STACKELBERG; WORST-CASE COMPLEXITY;

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

References (23)
  • 3
    • 58149325844 scopus 로고
    • Commitment and observability in games
    • Bagwell, K. 1995. Commitment and observability in games. Games and Economic Behavior 8:271-280.
    • (1995) Games and Economic Behavior , vol.8 , pp. 271-280
    • Bagwell, K.1
  • 5
    • 34447325155 scopus 로고    scopus 로고
    • Choosing what to protect
    • DOI 10.1111/j.1539-6924.2007.00906.x
    • Bier, V. M. 2007. Choosing what to protect. Risk Analysis 27(3):607-620. (Pubitemid 47063172)
    • (2007) Risk Analysis , vol.27 , Issue.3 , pp. 607-620
    • Bier, V.M.1
  • 6
    • 33748712836 scopus 로고    scopus 로고
    • Computing the optimal strategy to commit to
    • Conitzer, V., and Sandholm, T. 2006. Computing the optimal strategy to commit to. In ACM EC-06, 82-90.
    • (2006) ACM EC-06 , pp. 82-90
    • Conitzer, V.1    Sandholm, T.2
  • 8
    • 85051929411 scopus 로고    scopus 로고
    • Game theoretical insights in strategic patrolling: Model and algorithm in normal-form
    • Gatti, N. 2008. Game theoretical insights in strategic patrolling: Model and algorithm in normal-form. In ECAI-08, 403-407.
    • (2008) ECAI-08 , pp. 403-407
    • Gatti, N.1
  • 9
    • 78751683676 scopus 로고    scopus 로고
    • Multi-step multi-sensor hider-seeker games
    • Halvorson, E.; Conitzer, V.; and Parr, R. 2009. Multi-step multi-sensor hider-seeker games. In IJCAI.
    • (2009) IJCAI
    • Halvorson, E.1    Conitzer, V.2    Parr, R.3
  • 11
    • 84899860443 scopus 로고    scopus 로고
    • Computing optimal randomized resource allocations for massive security games
    • Kiekintveld, C.; Jain, M.; Tsai, J.; Pita, J.; Ordonez, F.; and Tambe, M. 2009. Computing optimal randomized resource allocations for massive security games. In AAMAS-09.
    • (2009) AAMAS-09
    • Kiekintveld, C.1    Jain, M.2    Tsai, J.3    Pita, J.4    Ordonez, F.5    Tambe, M.6
  • 12
    • 0018060592 scopus 로고
    • On generalized Stackelberg strategies
    • Leitmann, G. 1978. On generalized Stackelberg strategies. Optimization Theory and Applications 26(4):637-643.
    • (1978) Optimization Theory and Applications , vol.26 , Issue.4 , pp. 637-643
    • Leitmann, G.1
  • 14
    • 62349117616 scopus 로고    scopus 로고
    • Playing games with security: An efficient exact algorithm for Bayesian Stackelberg games
    • Paruchuri, P.; Pearce, J. P.; Marecki, J.; Tambe, M.; Ordonez, F.; and Kraus, S. 2008. Playing games with security: An efficient exact algorithm for Bayesian Stackelberg games. In AAMAS-08, 895-902.
    • (2008) AAMAS-08 , pp. 895-902
    • Paruchuri, P.1    Pearce, J.P.2    Marecki, J.3    Tambe, M.4    Ordonez, F.5    Kraus, S.6
  • 17
    • 2342507710 scopus 로고    scopus 로고
    • Stackelberg scheduling strategies
    • Roughgarden, T. 2004. Stackelberg scheduling strategies. SIAM Journal on Computing 33(2):332-350.
    • (2004) SIAM Journal on Computing , vol.33 , Issue.2 , pp. 332-350
    • Roughgarden, T.1
  • 18
    • 29344453416 scopus 로고    scopus 로고
    • Mixed-integer programming methods for finding Nash equilibria
    • Sandholm, T.; Gilpin, A.; and Conitzer, V. 2005. Mixed-integer programming methods for finding Nash equilibria. In AAAI-05, 495-501.
    • (2005) AAAI-05 , pp. 495-501
    • Sandholm, T.1    Gilpin, A.2    Conitzer, V.3
  • 19
    • 46649106463 scopus 로고    scopus 로고
    • Terrorism and game theory
    • Sandler, T., and M., D. G. A. 2003. Terrorism and game theory. Simulation and Gaming 34(3):319-337.
    • (2003) Simulation and Gaming , vol.34 , Issue.3 , pp. 319-337
    • Sandler, T.1    M, D.G.A.2


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