{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T21:11:10Z","timestamp":1760303470729,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032080660","type":"print"},{"value":"9783032080677","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-08067-7_14","type":"book-chapter","created":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:37:27Z","timestamp":1760301447000},"page":"273-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Sequential Fault-Intolerant Process Planning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1401-0157","authenticated-orcid":false,"given":"Andrzej","family":"Kaczmarczyk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4545-7341","authenticated-orcid":false,"given":"Davin","family":"Choo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5102-449X","authenticated-orcid":false,"given":"Niclas","family":"Boehmer","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3296-3672","authenticated-orcid":false,"given":"Milind","family":"Tambe","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6371-4906","authenticated-orcid":false,"given":"Haifeng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"3731","key":"14_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1126\/science.153.3731.34","volume":"153","author":"R Bellman","year":"1966","unstructured":"Bellman, R.: Dynamic programming. Science 153(3731), 34\u201337 (1966)","journal-title":"Science"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Blum, A.L., Langford, J.C.: Probabilistic planning in the graphplan framework. In: European Conference on Planning, pp. 319\u2013332. Springer (1999)","DOI":"10.1007\/10720246_25"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Boehmer, N., Han, M., Xu, H., Tambe, M.: Escape sensing games: Detection-vs-evasion in security applications. In: ECAI-24. pp. 3260\u20133267 (2024)","DOI":"10.3233\/FAIA240873"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., et al.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends Mach. Learn."},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1016\/j.jcss.2012.01.001","volume":"78","author":"N Cesa-Bianchi","year":"2012","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial bandits. J. Comput. Syst. Sci. 78(5), 1404\u20131422 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR7","unstructured":"Chen, L., Xu, J., Lu, Z.: Contextual combinatorial multi-armed bandits with volatile arms and submodular reward. NeurIPS-2018 31 (2018)"},{"key":"14_CR8","unstructured":"Chen, W., Wang, Y., Yuan, Y.: Combinatorial multi-armed bandit: General framework and applications. In: International Conference On Machine Learning-2013, pp. 151\u2013159 (2013)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Colas, C., Karch, T., Sigaud, O., Oudeyer, P.Y.: Autotelic agents with intrinsically motivated goal-conditioned reinforcement learning: A short survey. J. Artif. Int. Res. 74 (2022)","DOI":"10.1613\/jair.1.13554"},{"key":"14_CR10","unstructured":"Combes, R., et\u00a0al.: Combinatorial bandits revisited. In: Advances In Neural Information Processing Systems,vol.\u00a028 (2015)"},{"issue":"3\u20134","key":"14_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","volume":"2","author":"RE Fikes","year":"1971","unstructured":"Fikes, R.E., Nilsson, N.J.: Strips: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3\u20134), 189\u2013208 (1971)","journal-title":"Artif. Intell."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: theory and practice. Elsevier (2004)","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"14_CR13","unstructured":"Han, Q., Khamaru, K., Zhang, C.H.: UCB algorithms for multi-armed bandits: precise regret and adaptive inference. preprint arXiv:2412.06126 [math.ST] (2024)"},{"issue":"2","key":"14_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. and Cybern. 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. and Cybern."},{"key":"14_CR15","unstructured":"Hazan, E., Kale, S.: Online submodular minimization. J. Mach. Learn. Res. 13(10) (2012)"},{"key":"14_CR16","unstructured":"He, J., Zhou, D., Gu, Q.: Logarithmic regret for reinforcement learning with linear function approximation. In: Advances In Neural Information Processing Systems-2021, pp. 4171\u20134180 (2021)"},{"key":"14_CR17","first-page":"253","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Int. Res. 14, 253\u2013302 (2001)","journal-title":"J. Artif. Int. Res."},{"issue":"1\u20132","key":"14_CR18","first-page":"61","volume":"5","author":"V Jain","year":"2009","unstructured":"Jain, V., Benyoucef, L., Deshmukh, S.: Strategic supplier selection: some emerging issues and challenges. Int. J. Logist. Syst. Manag. 5(1\u20132), 61\u201388 (2009)","journal-title":"Int. J. Logist. Syst. Manag."},{"key":"14_CR19","unstructured":"Kaczmarczyk, A., Choo, D., Boehmer, N., Tambe, M., Xu, H.: On sequential fault-intolerant process planning. preprint arXiv:2502.04998 [cs.AI] (2025)"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-010-5178-7","volume":"80","author":"R Kleinberg","year":"2010","unstructured":"Kleinberg, R., Niculescu-Mizil, A., Sharma, Y.: Regret bounds for sleeping experts and bandits. Mach. Learn. 80(2), 245\u2013272 (2010)","journal-title":"Mach. Learn."},{"issue":"1\u20132","key":"14_CR21","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0004-3702(94)00087-H","volume":"76","author":"N Kushmerick","year":"1995","unstructured":"Kushmerick, N., Hanks, S., Weld, D.S.: An algorithm for probabilistic planning. Artif. Intell. 76(1\u20132), 239\u2013286 (1995)","journal-title":"Artif. Intell."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Szepesv\u00e1ri, C.: Bandit algorithms. Cambridge University Press (2020)","DOI":"10.1017\/9781108571401"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10207-004-0060-x","volume":"4","author":"Game strategies in network security","year":"2005","unstructured":"Game strategies in network security: Lye, K.w., Wing, J.M. Int. J. Inf. Secur. 4, 71\u201386 (2005)","journal-title":"Int. J. Inf. Secur."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Qin, L., Chen, S., Zhu, X.: Contextual combinatorial bandit and its application on diversified online recommendation. In: Proceedings of the 2014 SIAM International Conference on Data Mining, pp. 461\u2013469 (2014)","DOI":"10.1137\/1.9781611973440.53"},{"issue":"1\u20132","key":"14_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A., et al.: Introduction to multi-armed bandits. Found. Trends Mach. Learn. 12(1\u20132), 1\u2013286 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Stach, E., et al.: Autonomous experimentation systems for materials development: a community perspective. Matter 4(9) (9 2021)","DOI":"10.1016\/j.matt.2021.06.036"},{"key":"14_CR27","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. Adaptive Computation and Machine Learning, MIT Press (2018)","edition":"2"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Xu, H.: The mysteries of security games: equilibrium computation becomes combinatorial algorithm design. In: ACM Conference on Economics and Computation-16, pp. 497\u2013514 (2016)","DOI":"10.1145\/2940716.2940796"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Xu, H., et al.: Optimal patrol planning for green security games with black-box attackers. In: International Conference on Decision and Game Theory for Security-2017, pp. 458\u2013477 (2017)","DOI":"10.1007\/978-3-319-68711-7_24"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Probabilistic computations: toward a unified measure of complexity. In: 18th Annual Symposium on Foundations of Computer Science (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Game Theory and AI for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-08067-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:37:34Z","timestamp":1760301454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08067-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"ISBN":["9783032080660","9783032080677"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08067-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,13]]},"assertion":[{"value":"13 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Game Theory and AI for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.gamesec-conf.org\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}