{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:15:00Z","timestamp":1761808500525,"version":"3.37.3"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T00:00:00Z","timestamp":1644624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10472-022-09788-0","type":"journal-article","created":{"date-parts":[[2022,2,12]],"date-time":"2022-02-12T08:02:26Z","timestamp":1644652946000},"page":"373-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning machiavellian strategies for manipulation in Stackelberg security games"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5918-4671","authenticated-orcid":false,"given":"Julio B.","family":"Clempner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,12]]},"reference":[{"key":"9788_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.engappai.2019.03.010","volume":"81","author":"S Albarran","year":"2019","unstructured":"Albarran, S., Clempner, J.B.: A stackelberg security markov game based on partial information for strategic decision making against unexpected attacks. Eng. Appl. Artif. Intel. 81, 408\u2013419 (2019)","journal-title":"Eng. Appl. Artif. Intel."},{"key":"9788_CR2","doi-asserted-by":"publisher","first-page":"106695","DOI":"10.1016\/j.ress.2019.106695","volume":"19","author":"G Alcantara-Jim\u00e9nez","year":"2020","unstructured":"Alcantara-Jim\u00e9nez, G., Clempner, J.: Repeated stackelberg security games: Learning with incomplete state information. Reliab. Eng. Syst. Saf. 19, 106695 (2020)","journal-title":"Reliab. Eng. Syst. Saf."},{"issue":"11","key":"9788_CR3","doi-asserted-by":"publisher","first-page":"3591","DOI":"10.1007\/s00500-018-3225-7","volume":"23","author":"E Asiain","year":"2019","unstructured":"Asiain, E., Clempner, J.B., Poznyak, A.S.: Controller exploitation-exploration: a reinforcement learning architecture. Soft. Comput. 23(11), 3591\u20133604 (2019)","journal-title":"Soft. Comput."},{"key":"9788_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Blum, A., Haghtalab, N., Procaccia, A.D.: Commitment without regrets: Online learning in stackelberg security games. In: Proceedings of the Sixteenth ACM Conference on Economics and Computation, pp. 61\u201378. ACM New York, NY, USA, Portland, Oregon, USA (2015)","DOI":"10.1145\/2764468.2764478"},{"key":"9788_CR5","unstructured":"Blum, A., Haghtalab, N., Procaccia, A.D.: Learning optimal commitment to overcome insecurity. In: G. Cowan, C. C\u00e9cile Germain, I. Guyon, B. K\u00e9gl, D. Rousseau (eds.) Proceedings of the 28th Annual Conference on Neural Information Processing Systems (NIPS), vol. 1, pp. 1826\u20131834. MIT Press Cambridge, MA, USA, Montreal, Quebec, Canada (2014)"},{"key":"9788_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.scs.2018.02.039","volume":"39","author":"T Braun","year":"2018","unstructured":"Braun, T., Fung, B., Iqbal, F., Shah, B.: Security and privacy challenges in smart cities. Sustain. Cities Soc. 39, 499\u2013507 (2018)","journal-title":"Sustain. Cities Soc."},{"key":"9788_CR7","unstructured":"Bucarey, V., Vecchia, E.D., Jean-Marie, A., Ord\u00f3\u00f1ez, F.: Stationary strong stackelberg equilibrium in discounted stochastic games. Tech. Rep. hal-02144095 INRIA (2019)"},{"key":"9788_CR8","doi-asserted-by":"crossref","unstructured":"Christie, R., Geis, F.: Studies in machiavellianism. Academic press (1970)","DOI":"10.1016\/B978-0-12-174450-2.50006-3"},{"issue":"2","key":"9788_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18564\/jasss.3301","volume":"20","author":"JB Clempner","year":"2017","unstructured":"Clempner, J.B.: A game theory model of manipulation based on the machiavellian social interaction theory: Moral and ethical behavior. J. Artif. Soc. Soc. Simul. 20(2), 1\u201312 (2017)","journal-title":"J. Artif. Soc. Soc. Simul."},{"issue":"11","key":"9788_CR10","doi-asserted-by":"publisher","first-page":"2494","DOI":"10.1080\/00207179.2017.1371853","volume":"91","author":"JB Clempner","year":"2018","unstructured":"Clempner, J.B.: A continuous-time markov stackelberg security game approach for reasoning about real patrol strategies. Int. J. Control. 91(11), 2494\u20132510 (2018). https:\/\/doi.org\/10.1080\/00207179.2017.1371853","journal-title":"Int. J. Control."},{"key":"9788_CR11","unstructured":"Clempner, J.B.: On lyapunov game theory equilibrium: Static and dynamic approaches, International Game Theory Review 20(2), 1750,033\u20131\u20131750, 033\u201314 (2018)"},{"issue":"1","key":"9788_CR12","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/s10957-018-1301-x","volume":"178","author":"JB Clempner","year":"2018","unstructured":"Clempner, J.B.: Strategic manipulation approach for solving negotiated transfer pricing problem. J. Optim. Theory Appl. 178(1), 304\u2013316 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"6","key":"9788_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-021-01578-4","volume":"40","author":"JB Clempner","year":"2021","unstructured":"Clempner, J.B.: A markovian stackelberg game approach for computing an optimal dynamic mechanism. Comput. Appl. Math. 40(6), 1\u201325 (2021)","journal-title":"Comput. Appl. Math."},{"issue":"2","key":"9788_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.2478\/v10006-011-0026-x","volume":"21","author":"JB Clempner","year":"2011","unstructured":"Clempner, J.B., Poznyak, A.S.: Convergence method, properties and computational complexity for lyapunov games. Int. J. Appl. Math. Comput. Sci. 21(2), 349\u2013361 (2011)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"9788_CR15","doi-asserted-by":"crossref","unstructured":"Clempner, J.B., Poznyak, A.S.: Simple computing of the customer lifetime value: A fixed local-optimal policy approach Journal of Systems Science and Systems Engineering. http:\/\/link.springer.com\/article\/10.1007\/s11518-014-5260-y (2014)","DOI":"10.1007\/s11518-014-5260-y"},{"key":"9788_CR16","first-page":"911","volume":"265","author":"JB Clempner","year":"2015","unstructured":"Clempner, J.B., Poznyak, A.S.: Computing the strong nash equilibrium for markov chains games. Appl. Math. Comput. 265, 911\u2013927 (2015)","journal-title":"Appl. Math. Comput."},{"issue":"8","key":"9788_CR17","doi-asserted-by":"publisher","first-page":"3967","DOI":"10.1016\/j.eswa.2014.12.034","volume":"42","author":"JB Clempner","year":"2015","unstructured":"Clempner, J.B., Poznyak, A.S.: Stackelberg security games: Computing the shortest-path equilibrium. Expert Syst Appl 42(8), 3967\u20133979 (2015)","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9788_CR18","first-page":"41","volume":"50","author":"JB Clempner","year":"2016","unstructured":"Clempner, J.B., Poznyak, A.S.: Analyzing an optimistic attitude for the leader firm in duopoly models: a strong stackelberg equilibrium based on a lyapunov game theory approach. Econ. Comput. Econ. Cybern. Stud. Res. 50(4), 41\u201360 (2016)","journal-title":"Econ. Comput. Econ. Cybern. Stud. Res."},{"key":"9788_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2016.05.037","volume":"47","author":"JB Clempner","year":"2016","unstructured":"Clempner, J.B., Poznyak, A.S.: Conforming coalitions in stackelberg security games: Setting max cooperative defenders vs. non-cooperative attackers. Appl. Soft Comput. 47, 1\u201311 (2016)","journal-title":"Appl. Soft Comput."},{"key":"9788_CR20","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.eswa.2015.11.006","volume":"46","author":"JB Clempner","year":"2016","unstructured":"Clempner, J.B., Poznyak, A.S.: Convergence analysis for pure and stationary strategies in repeated potential games: Nash, lyapunov and correlated equilibria. Expert Syst. Appl. 46, 474\u2013484 (2016)","journal-title":"Expert Syst. Appl."},{"key":"9788_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.matcom.2016.12.010","volume":"138","author":"JB Clempner","year":"2017","unstructured":"Clempner, J.B., Poznyak, A.S.: Using the extraproximal method for computing the shortest-path mixed lyapunov equilibrium in stackelberg security games. Math. Comput. Simul. 138, 14\u201330 (2017)","journal-title":"Math. Comput. Simul."},{"key":"9788_CR22","doi-asserted-by":"crossref","unstructured":"Elderman, R., Pater, L.A.T., Drugan, M., Wiering, M.: Adversarial Reinforcement Learning in a Cyber Security Simulation. In: 9Th International Conference on Agents and Artificial Intelligence, pp. 1\u20138. INSTICC, Porto, Portugal (2017)","DOI":"10.5220\/0006197105590566"},{"issue":"4","key":"9788_CR23","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s13235-018-00291-y","volume":"9","author":"SR Etesami","year":"2019","unstructured":"Etesami, S.R., Ba\u015far, T.: Dynamic games in cyber-physical security: an overview. Dyn. Games Appl. 9(4), 884\u2013913 (2019)","journal-title":"Dyn. Games Appl."},{"key":"9788_CR24","unstructured":"Gan, J., Elkind, E., Wooldridge, M.: Stackelberg Security Games with Multiple Uncoordinated Defenders. In: Procedings of the 17Th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 703\u2013711. Stockholm, Sweden (2018)"},{"key":"9788_CR25","doi-asserted-by":"crossref","unstructured":"Guerrero, D., Carsteanu, A., Huerta, R., Clempner, J.B.: An Iterative Method for Solving Stackelberg Security Games: a Markov Games Approach. In: 14Th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), pp. 1\u20136. Mexico city, Mexico (2017)","DOI":"10.1109\/ICEEE.2017.8108857"},{"key":"9788_CR26","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.cose.2018.01.005","volume":"74","author":"D Guerrero","year":"2018","unstructured":"Guerrero, D., Carsteanu, A.A., Huerta, R., Clempner, J.B.: Solving stackelberg security markov games employing the bargaining nash approach: Convergence analysis. Comput. Sec. 74, 240\u2013257 (2018)","journal-title":"Comput. Sec."},{"issue":"101","key":"9788_CR27","first-page":"660","volume":"50","author":"H Habibzadeh","year":"2019","unstructured":"Habibzadeh, H., Nussbaum, B., Anjomshoa, F., Kantarci, B., Soyata, T.: A survey on cybersecurity, data privacy, and policy issues in cyber-physical system deployments in smart cities. Sustain. Cities Soc. 50(101), 660 (2019)","journal-title":"Sustain. Cities Soc."},{"key":"9788_CR28","doi-asserted-by":"crossref","unstructured":"He, X., Dai, H., Ning, P.: Improving learning and adaptation in security games by exploiting information asymmetry. In: Proceedings of IEEE INFOCOM. IEEE Communications Society, Hong Kong, China (2015)","DOI":"10.1109\/INFOCOM.2015.7218560"},{"key":"9788_CR29","unstructured":"Klima, R., Tuyls, K., Oliehoek, F.: Markov Security Games: Learning in Spatial Security Problems. In: NIPS\u201916 Workshop on Learning, Inference and Control of Multi-Agent Systems. NIPS, Barcelona, Spain (2016)"},{"key":"9788_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1613\/jair.3269","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. Intell. Res. 41, 297\u2013327 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"9788_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2019.02.004","volume":"274","author":"ES Lin","year":"2019","unstructured":"Lin, E.S., Agmon, N., Sarit Kraus, S.: Multi-robot adversarial patrolling: Handling sequential attacks. Artif. Intell. 274, 1\u201325 (2019)","journal-title":"Artif. Intell."},{"key":"9788_CR32","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.eswa.2018.03.066","volume":"108","author":"W Ma","year":"2018","unstructured":"Ma, W., McAreavey, K., Liu, W., Luoc, X.: Acceptable costs of minimax regret equilibrium: a solution to security games with surveillance-driven probabilistic information. Expert Syst. Appl. 108, 206\u2013222 (2018)","journal-title":"Expert Syst. Appl."},{"key":"9788_CR33","unstructured":"Marecki, J., Tesauro, G., Segal, R.: Playing repeated stackelberg games with unknown opponents. In: Proceedings of the 11th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), vol. 2, pp. 821\u2013828. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, Valencia, Spain (2012)"},{"key":"9788_CR34","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.scs.2018.03.005","volume":"39","author":"S Marques","year":"2018","unstructured":"Marques, S., Ferreira, F., Banaitis, I.: A.: Classifying urban residential areas based on their exposure to crime: A constructivist approach. Sustain. Cities Soc. 39, 418\u2013429 (2018)","journal-title":"Sustain. Cities Soc."},{"key":"9788_CR35","volume-title":"Self-Learning Control of Finite Markov Chains","author":"AS Poznyak","year":"2000","unstructured":"Poznyak, A.S., Najim, K., G\u00f3mez-Ram\u00edrez, E.: Self-Learning Control of Finite Markov Chains. Inc, Marcel Dekker (2000)"},{"key":"9788_CR36","doi-asserted-by":"crossref","unstructured":"Rahman, M., Oh, J.: Online Learning for Patrolling Robots against Active Adversarial Attackers. In: Mouhoub, M., Sadaoui, S. Ait Mohamed, O. Ali, M. (eds.) Recent Trends and Future Technology in Applied Intelligence, Lecture Notes in Computer Science, vol. 10868. Springer, Springer, Cham, Montreal, Quebec, Canada (2018)","DOI":"10.1007\/978-3-319-92058-0_46"},{"key":"9788_CR37","unstructured":"Sayed Ahmed, I.: Stackelberg-Based Anti-Jamming Game for Cooperative Cognitive Radio Networks. Ph.D. Thesis, CALGARY, ALBERTA (2017)"},{"key":"9788_CR38","unstructured":"Solis, C.U., Clempner, J.B., Poznyak, A.S.: Solving Stackelberg Security Games for Multiple Defenders and Multiple Attackers. In: 26Th Stony Brook International Conference on Game Theory. New York, USA (2015)"},{"issue":"8","key":"9788_CR39","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1080\/01969722.2016.1232121","volume":"47","author":"CU Solis","year":"2016","unstructured":"Solis, C.U., Clempner, J.B., Poznyak, A.S.: Modeling multi-leader-follower non-cooperative stackelberg games. Cybern. Syst. 47(8), 650\u2013673 (2016)","journal-title":"Cybern. Syst."},{"key":"9788_CR40","doi-asserted-by":"crossref","unstructured":"Solis, C.U., Clempner, J.B., Poznyak, A.S.: Handling a Kullback-Leibler Divergence Random Walk for Scheduling Effective Patrol Strategies in Stackelberg Security Games. Kybernetika. To be published (2019)","DOI":"10.14736\/kyb-2019-4-0618"},{"key":"9788_CR41","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.geb.2009.11.008","volume":"69","author":"B von Stengel","year":"2010","unstructured":"von Stengel, B., Zamir, S.: Leadership games with convex strategy sets. Games Econ. Behav. 69, 446\u2013457 (2010)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"9788_CR42","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1515\/amcs-2015-0026","volume":"25","author":"KK Trejo","year":"2015","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: Computing the stackelberg\/nash equilibria using the extraproximal method: Convergence analysis and implementation details for markov chains games. Int. J. Appl. Math. Comput. Sci. 25(2), 337\u2013351 (2015)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"key":"9788_CR43","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.engappai.2014.09.002","volume":"37","author":"KK Trejo","year":"2015","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: A stackelberg security game with random strategies based on the extraproximal theoretic approach. Eng. Appl. Artif. Intel. 37, 145\u2013153 (2015)","journal-title":"Eng. Appl. Artif. Intel."},{"key":"9788_CR44","doi-asserted-by":"crossref","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: Adapting Strategies to Dynamic Environments in Controllable Stackelberg Security Games. In: IEEE 55th Conference on Decision and Control (CDC), pp. 5484\u20135489. IEEE, Las Vegas, USA (2016)","DOI":"10.1109\/CDC.2016.7799111"},{"key":"9788_CR45","doi-asserted-by":"crossref","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: An optimal strong equilibirum solution for cooperative multi-leader-follower stackelberg markov chains games. Kibernetika. To be published (2016)","DOI":"10.14736\/kyb-2016-2-0258"},{"key":"9788_CR46","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.apm.2016.09.001","volume":"41","author":"KK Trejo","year":"2017","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: Computing the lp-strong nash equilibrium for markov chains games. Appl. Math. Model. 41, 399\u2013418 (2017)","journal-title":"Appl. Math. Model."},{"key":"9788_CR47","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.jcss.2017.12.004","volume":"95","author":"KK Trejo","year":"2018","unstructured":"Trejo, K.K., Clempner, J.B., Poznyak, A.S.: Adapting attackers and defenders preferred strategies: a reinforcement learning approach in stackelberg security games. J. Comput. Syst. Sci. 95, 35\u201354 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"9788_CR48","unstructured":"Vanek, O., Jakob, M., Lisy, V., Bosansky, B., Michal Pechoucek, M.: Iterative Game-Theoretic Route Selection for Hostile Area Transit and Patrolling. In: The 10th International Conference on Autonomous Agents and Multiagent Systems, pp. 1273\u20131274. Taipei, Taiwan (2011)"},{"key":"9788_CR49","doi-asserted-by":"crossref","unstructured":"Wang, Y., Shi, Z., Yu, L., Wu, Y., Singh, R., Joppa, L., Fang, F.: Deep Reinforcement Learning for Green Security Games with Real-Time Information. In: The Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19), pp. 1401\u20131408. Honolulu, Hawaii (2019)","DOI":"10.1609\/aaai.v33i01.33011401"},{"key":"9788_CR50","first-page":"70","volume":"3","author":"A Wilczy\u0144ski","year":"2016","unstructured":"Wilczy\u0144ski, A., Jak\u00f3bik, A., Ko\u0142odziej, J.: Stackelberg security games: Models, applications and computational aspects. J. Telecommun. Inf. Technol. 3, 70\u201379 (2016)","journal-title":"J. Telecommun. Inf. Technol."},{"key":"9788_CR51","unstructured":"Xu, H., Tran-Thanh, L., Jennings, N.R.: Playing repeated security games with no prior knowledge. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 104\u2013112. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, Singapore, Singapore (2016)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09788-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-022-09788-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09788-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:07:36Z","timestamp":1649038056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-022-09788-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,12]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["9788"],"URL":"https:\/\/doi.org\/10.1007\/s10472-022-09788-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2022,2,12]]},"assertion":[{"value":"27 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Competing interests"}}]}}