{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T15:42:26Z","timestamp":1766504546754,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319255934"},{"type":"electronic","value":"9783319255941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25594-1_13","type":"book-chapter","created":{"date-parts":[[2015,11,11]],"date-time":"2015-11-11T02:03:13Z","timestamp":1447207393000},"page":"228-249","source":"Crossref","is-referenced-by-count":20,"title":["Approximate Solutions for Attack Graph Games with Imperfect Information"],"prefix":"10.1007","author":[{"given":"Karel","family":"Durkota","sequence":"first","affiliation":[]},{"given":"Viliam","family":"Lis\u00fd","sequence":"additional","affiliation":[]},{"given":"Branislav","family":"Bo\u0161ansk\u00fd","sequence":"additional","affiliation":[]},{"given":"Christopher","family":"Kiekintveld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,12]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ammann, P., Wijesekera, D., Kaushik, S.: Scalable, graph-based network vulnerability analysis. In: Proceedings of CCS, pp. 217\u2013224 (2002)","DOI":"10.1145\/586110.586140"},{"key":"13_CR2","unstructured":"Bacic, E., Froh, M., Henderson, G.: Mulval extensions for dynamic asset protection. Technical report, DTIC Document (2006)"},{"issue":"1","key":"13_CR3","first-page":"513","volume":"38","author":"M Benisch","year":"2010","unstructured":"Benisch, M., Davis, G.B., Sandholm, T.: Algorithms for closed under rational behavior (curb) sets. J. Artif. Int. Res. 38(1), 513\u2013534 (2010)","journal-title":"J. Artif. Int. Res."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.2307\/1911196","volume":"52","author":"BD Bernheim","year":"1984","unstructured":"Bernheim, B.D.: Rationalizable strategic behavior. Econometrica 52, 1007\u20131028 (1984)","journal-title":"Econometrica"},{"key":"13_CR5","unstructured":"Boddy, M.S., Gohde, J., Haigh, T., Harp, S.A.: Course of action generation for cyber security using classical planning. In: Proceedings of ICAPS, pp. 12\u201321 (2005)"},{"key":"13_CR6","first-page":"829","volume":"51","author":"B Bo\u0161ansk\u00fd","year":"2014","unstructured":"Bo\u0161ansk\u00fd, B., Kiekintveld, C., Lis\u00fd, V., P\u011bchou\u010dek, M.: An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information. J. Artif. Int. Res. 51, 829\u2013866 (2014)","journal-title":"J. Artif. Int. Res."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bo\u0161ansk\u00fd, B., \u010cermak, J.: Sequence-form algorithm for computing stackelberg equilibria in extensive-form games. In: Proceedings of AAAI Conference on AI, pp. 805\u2013811 (2015)","DOI":"10.1609\/aaai.v29i1.9304"},{"issue":"10","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1162","DOI":"10.1002\/sec.242","volume":"4","author":"TE Carroll","year":"2011","unstructured":"Carroll, T.E., Grosu, D.: A game theoretic investigation of deception in network security. Secur. Commun. Netw. 4(10), 1162\u20131172 (2011)","journal-title":"Secur. Commun. Netw."},{"key":"13_CR9","unstructured":"Cassandra, A., Littman, M.L., Zhang, N.L.: Incremental pruning: a simple, fast, exact method for partially observable markov decision processes. In: Proceedings of UAI, pp. 54\u201361. Morgan Kaufmann Publishers Inc. (1997)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Korzhyk, D.: Commitment to correlated strategies. In: Proceedings of AAAI, pp. 632\u2013637 (2011)","DOI":"10.1609\/aaai.v25i1.7875"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Conitzer, V., Sandholm, T.: Computing the optimal strategy to commit to. In: Proceedings of ACM EC, pp. 82\u201390. ACM (2006)","DOI":"10.1145\/1134707.1134717"},{"key":"13_CR12","unstructured":"Durkota, K., Lis\u00fd, V., Bo\u0161ansk\u00fd, B., Kiekintveld, C.: Optimal network security hardening using attack graph games. In: Proceedings of IJCAI, pp. 7\u201314 (2015)"},{"key":"13_CR13","unstructured":"Grimes, R.A., Nepomnjashiy, A., Tunnissen, J.: Honeypots for windows (2005)"},{"issue":"4","key":"13_CR14","doi-asserted-by":"crossref","first-page":"561","DOI":"10.3233\/JCS-130475","volume":"21","author":"J Homer","year":"2013","unstructured":"Homer, J., Zhang, S., Ou, X., Schmidt, D., Du, Y., Rajagopalan, S.R., Singhal, A.: Aggregating vulnerability metrics in enterprise networks using attack graphs. J. Comput. Secur. 21(4), 561\u2013597 (2013)","journal-title":"J. Comput. Secur."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Ingols, K., Lippmann, R., Piwowarski, K.: Practical attack graph generation for network defense. In: Proceedings of ACSAC, pp. 121\u2013130 (2006)","DOI":"10.1109\/ACSAC.2006.39"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/game.1996.0051","volume":"14","author":"D Koller","year":"1996","unstructured":"Koller, D., Megiddo, N., Von Stengel, B.: Efficient computation of equilibria for extensive two-person games. Games Econ. Behav. 14(2), 247\u2013259 (1996)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"13_CR17","first-page":"297","volume":"41","author":"D Korzhyk","year":"2011","unstructured":"Korzhyk, D., Yin, Z., Kiekintveld, C., Conitzer, V., Tambe, M.: Stackelberg vs. nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. J. Artif. Int. Res. 41(2), 297\u2013327 (2011)","journal-title":"J. Artif. Int. Res."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Letchford, J., Conitzer, V.: Computing optimal strategies to commit to in extensive-form games. In: Proceedings of ACM EC, pp. 83\u201392 (2010)","DOI":"10.1145\/1807342.1807354"},{"key":"13_CR19","unstructured":"Letchford, J., Vorobeychik, Y.: Optimal interdiction of attack plans. In: Proceedings of AAMAS, pp. 199\u2013206 (2013)"},{"key":"13_CR20","unstructured":"Littman, M.L.: The witness algorithm: Solving partially observable markov decision processes. Technical report, Providence, RI, USA (1994)"},{"key":"13_CR21","unstructured":"Lucangeli Obes, J., Sarraute, C., Richarte, G.: Attack planning in the real world. In: Working notes of SecArt 2010 at AAAI, pp. 10\u201317 (2010)"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/MSP.2006.145","volume":"4","author":"P Mell","year":"2006","unstructured":"Mell, P., Scarfone, K., Romanosky, S.: Common vulnerability scoring system. Secur. Priv. 4, 85\u201389 (2006)","journal-title":"Secur. Priv."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Noel, S., Jajodia, S.: Managing attack graph complexity through visual hierarchical aggregation. In: Proceedings of ACM VizSEC\/DMSEC, pp. 109\u2013118. ACM (2004)","DOI":"10.1145\/1029208.1029225"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10922-008-9109-x","volume":"16","author":"S Noel","year":"2008","unstructured":"Noel, S., Jajodia, S.: Optimal ids sensor placement and alert prioritization using attack graphs. J. Netw. Syst. Manage. 16, 259\u2013275 (2008)","journal-title":"J. Netw. Syst. Manage."},{"issue":"1","key":"13_CR25","first-page":"135","volume":"1","author":"S Noel","year":"2010","unstructured":"Noel, S., Jajodia, S., Wang, L., Singhal, A.: Measuring security risk of networks using attack graphs. Int. J. Next-Gener. Comput. 1(1), 135\u2013147 (2010)","journal-title":"Int. J. Next-Gener. Comput."},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Ou, X., Boyer, W.F., McQueen, M.A.: A scalable approach to attack graph generation. In: Proceedings of ACM CCS, pp. 336\u2013345. ACM (2006)","DOI":"10.1145\/1180405.1180446"},{"key":"13_CR27","unstructured":"Ou, X., Govindavajhala, S., Appel, A.W.: Mulval: a logic-based network security analyzer. In: Proceedings of USENIX SSYM. pp. 113\u2013128. USENIX Association, Berkeley (2005)"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-34266-0_12","volume-title":"Decision and Game Theory for Security","author":"R P\u00edbil","year":"2012","unstructured":"P\u00edbil, R., Lis\u00fd, V., Kiekintveld, C., Bo\u0161ansk\u00fd, B., P\u011bchou\u010dek, M.: Game theoretic model of strategic honeypot selection in computer networks. In: Grossklags, J., Walrand, J. (eds.) GameSec 2012. LNCS, vol. 7638, pp. 201\u2013220. Springer, Heidelberg (2012)"},{"key":"13_CR29","unstructured":"Provos, N.: A virtual honeypot framework. In: Proceedings of USENIX SSYM, pp. 1\u201314. Berkeley, CA, USA (2004)"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Qassrawi, M.T., Hongli, Z.: Deception methodology in virtual honeypots. In: Proceedings of NSWCTC, vol. 2, pp. 462\u2013467. IEEE (2010)","DOI":"10.1109\/NSWCTC.2010.266"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-88313-5_2","volume-title":"Computer Security - ESORICS 2008","author":"RE Sawilla","year":"2008","unstructured":"Sawilla, R.E., Ou, X.: Identifying critical attack assets in dependency attack graphs. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 18\u201334. Springer, Heidelberg (2008)"},{"key":"13_CR32","doi-asserted-by":"crossref","unstructured":"Sheyner, O., Haines, J., Jha, S., Lippmann, R., Wing, J.M.: Automated generation and analysis of attack graphs. In: IEEE Symposium Security and Privacy, pp. 273\u2013284. IEEE (2002)","DOI":"10.1109\/SECPRI.2002.1004377"},{"key":"13_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973031","volume-title":"Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned","author":"M Tambe","year":"2011","unstructured":"Tambe, M.: Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"issue":"4","key":"13_CR34","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1287\/moor.1080.0340","volume":"33","author":"B Stengel Von","year":"2008","unstructured":"Von Stengel, B., Forges, F.: Extensive form correlated equilibrium: definition and computational complexity. Math. Oper. Res. 33(4), 1002\u20131022 (2008)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25594-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T11:04:56Z","timestamp":1748689496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25594-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319255934","9783319255941"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25594-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}