{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:52:32Z","timestamp":1743101552966,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030903695"},{"type":"electronic","value":"9783030903701"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90370-1_5","type":"book-chapter","created":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T06:18:05Z","timestamp":1635574685000},"page":"80-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scalable Optimal Classifiers for\u00a0Adversarial Settings Under Uncertainty"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Roussillon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Loiseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,31]]},"reference":[{"key":"5_CR1","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 EC, pp. 61\u201378 (2015)","DOI":"10.1145\/2764468.2764478"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10994-010-5188-5","volume":"81","author":"M Barreno","year":"2010","unstructured":"Barreno, M., Nelson, B., Joseph, A.D., Tygar, J.D.: The security of machine learning. Mach. Learn. 81(2), 121\u2013148 (2010). https:\/\/doi.org\/10.1007\/s10994-010-5188-5","journal-title":"Mach. Learn."},{"key":"5_CR3","unstructured":"Bo\u0161ansk\u00fd, B., Lis\u00fd, V., Jakob, M., P\u011bchou\u010dek, M.: Computing time-dependent policies for patrolling games with mobile targets. In: Proceedings of AAMAS, pp. 989\u2013996 (2011)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Brown, M., Sinha, A., Schlenker, A., Tambe, M.: One size does not fit all: a game-theoretic approach for dynamically and effectively screening for threats. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, pp. 425\u2013431 (2016)","DOI":"10.1609\/aaai.v30i1.10023"},{"key":"5_CR5","first-page":"2617","volume":"13","author":"M Br\u00fcckner","year":"2012","unstructured":"Br\u00fcckner, M., Kanzow, C., Scheffer, T.: Static prediction games for adversarial learning problems. J. Mach. Learn. Res. 13, 2617\u20132654 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00fcckner, M., Scheffer, T.: Stackelberg games for adversarial prediction problems. In: Proceedings of ACM SIGKDD, pp. 547\u2013555 (2011)","DOI":"10.1145\/2020408.2020495"},{"issue":"11","key":"5_CR7","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1109\/TNNLS.2016.2593488","volume":"28","author":"SR Bul\u00f2","year":"2016","unstructured":"Bul\u00f2, S.R., Biggio, B., Pillai, I., Pelillo, M., Roli, F.: Randomized prediction games for adversarial machine learning. IEEE Trans. Neural Netw. Learn. Syst. 28(11), 2466\u20132478 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2089125.2089129","volume":"44","author":"G Caruana","year":"2012","unstructured":"Caruana, G., Li, M.: A survey of emerging approaches to spam filtering. ACM Comput. Surv. 44(2), 9:1-9:27 (2012)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/TIFS.2009.2019154","volume":"4","author":"L Chen","year":"2009","unstructured":"Chen, L., Leneutre, J.: A game theoretical framework on intrusion detection in heterogeneous networks. IEEE Trans. Inf. Forensics Secur. 4(2), 165\u2013178 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR10","unstructured":"Chen, Y., Liu, Y., Podimata, C.: Learning strategy-aware linear classifiers. In: Proceedings of NIPS (2020)"},{"key":"5_CR11","unstructured":"Cullina, D., Bhagoji, A.N., Mittal, P.: PAC-learning in the presence of adversaries. In: Advances in Neural Information Processing Systems (NIPS), vol. 31, pp. 230\u2013241 (2018)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Pozzolo, A.D., Caelen, O., Johnson, R.A., Bontempi, G.: Calibrating probability with undersampling for unbalanced classification. In: 2015 IEEE Symposium Series on Computational Intelligence, pp. 159\u2013166. IEEE (2015)","DOI":"10.1109\/SSCI.2015.33"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Dalvi, N., Domingos, P., Mausam, Sanghai, S., Verma, D.: Adversarial classification. In: Proceedings of ACM KDD, pp. 99\u2013108 (2004)","DOI":"10.1145\/1014052.1014066"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Dasgupta, P., Collins, J.B., McCarrick, M.: Improving costs and robustness of machine learning classifiers against adversarial attacks via self play of repeated Bayesian games. In: The Thirty-Third International Flairs Conference (2020)","DOI":"10.1117\/12.2585849"},{"issue":"12","key":"5_CR15","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1109\/TIFS.2017.2718494","volume":"12","author":"L Dritsoula","year":"2017","unstructured":"Dritsoula, L., Loiseau, P., Musacchio, J.: A game-theoretic analysis of adversarial classification. IEEE Trans. Inf. Forensics Secur. 12(12), 3094\u20133109 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Fang, F., Jiang, A.X., Tambe, M.: Optimal patrol strategy for protecting moving targets with multiple mobile resources. In: Proceedings of AAMAS, pp. 957\u2013964 (2013)","DOI":"10.1613\/jair.4027"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Forges, F.: Chapter 6 Repeated games of incomplete information: non-zero-sum. In: Aumann, R., Hart, S. (eds.) Handbook of Game Theory with Economic Applications, vol. 1, pp. 155\u2013177. Elsevier (1992)","DOI":"10.1016\/S1574-0005(05)80009-8"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Globerson, A., Roweis, S.: Nightmare at test time: robust learning by feature deletion. In: Proceedings of ICML (2006)","DOI":"10.1145\/1143844.1143889"},{"key":"5_CR19","unstructured":"Goodfellow, I., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: ICLR (2015). arXiv:1412.6572"},{"key":"5_CR20","unstructured":"Gro\u00dfhans, M., Sawade, C., Br\u00fcckner, M., Scheffer, T.: Bayesian games for adversarial regression problems. In: Proceedings of ICML, pp. III-55-III-63 (2013)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Huang, L., Joseph, A.D., Nelson, B., Rubinstein, B.I.P., Tygar, J.D.: Adversarial machine learning. In: Proceedings of ACM AISec, pp. 43\u201358 (2011)","DOI":"10.1145\/2046684.2046692"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Kalai, A.T., Lucier, B., Moitra, A., Postlewaite, A., Tennenholtz, M.: Dueling algorithms. In: Proceedings of STOC, pp. 215\u2013224 (2011)","DOI":"10.1145\/1993636.1993666"},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10618-010-0197-3","volume":"22","author":"M Kantarcioglu","year":"2011","unstructured":"Kantarcioglu, M., Xi, B., Clifton, C.: Classifier evaluation and attribute selection against active adversaries. Data Min. Knowl. Disc. 22(1), 291\u2013335 (2011). https:\/\/doi.org\/10.1007\/s10618-010-0197-3","journal-title":"Data Min. Knowl. Disc."},{"key":"5_CR24","unstructured":"Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ord\u00f3\u00f1ez, F., Tambe, M.: Computing optimal randomized resource allocations for massive security games. In: Proceedings of AAMAS, pp. 689\u2013696 (2009)"},{"key":"5_CR25","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-1-4939-1384-8_8","volume-title":"Handbook of Simulation Optimization","author":"S Kim","year":"2015","unstructured":"Kim, S., Pasupathy, R., Henderson, S.G.: A guide to sample average approximation. In: Fu, M.C. (ed.) Handbook of Simulation Optimization. ISORMS, vol. 216, pp. 207\u2013243. Springer, New York (2015). https:\/\/doi.org\/10.1007\/978-1-4939-1384-8_8"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: Proceedings of AAAI, pp. 805\u2013810 (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-010-5207-6","volume":"81","author":"P Laskov","year":"2010","unstructured":"Laskov, P., Lippmann, R.: Machine learning in adversarial environments. Mach. Learn. 81(2), 115\u2013119 (2010). https:\/\/doi.org\/10.1007\/s10994-010-5207-6","journal-title":"Mach. Learn."},{"key":"5_CR28","unstructured":"Li, B., Vorobeychik, Y.: Feature cross-substitution in adversarial classification. In: Proceedings of NIPS, pp. 2087\u20132095 (2014)"},{"key":"5_CR29","unstructured":"Li, B., Vorobeychik, Y.: Scalable optimization of randomized operational decisions in adversarial classification settings. In: Proceedings of AISTATS (2015)"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10479-006-6169-8","volume":"142","author":"J Linderoth","year":"2006","unstructured":"Linderoth, J., Shapiro, A., Wright, S.: The empirical behavior of sampling methods for stochastic programming. Ann. Oper. Res. 142(1), 215\u2013241 (2006). https:\/\/doi.org\/10.1007\/s10479-006-6169-8","journal-title":"Ann. Oper. Res."},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-44851-9_16","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"V Lis\u00fd","year":"2014","unstructured":"Lis\u00fd, V., Kessl, R., Pevn\u00fd, T.: Randomized operating point selection in adversarial classification. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014. LNCS (LNAI), vol. 8725, pp. 240\u2013255. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44851-9_16"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Loiseau, P., Roussillon, B.: Scalable optimal classifiers for adversarial settings under uncertainty (2021)","DOI":"10.1007\/978-3-030-90370-1_5"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Lowd, D., Meek, C.: Adversarial learning. In: Proceedings of ACM KDD, pp. 641\u2013647 (2005)","DOI":"10.1145\/1081870.1081950"},{"key":"5_CR34","unstructured":"Marecki, J., Tesauro, G., Segal, R.: Playing repeated Stackelberg games with unknown opponents. In: Proceedings of AAMAS, pp. 821\u2013828 (2012)"},{"key":"5_CR35","unstructured":"Nelson, B., et al.: Near optimal evasion of convex-inducing classifiers. In: Proceedings of AISTATS (2010)"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-0-387-88735-7_2","volume-title":"Machine Learning in Cyber Trust: Security, Privacy, and Reliability","author":"B Nelson","year":"2009","unstructured":"Nelson, B., et al.: Misleading learners: co-opting your spam filter. In: Yu, P.S., Tsai, J.J.P. (eds.) Machine Learning in Cyber Trust: Security, Privacy, and Reliability, pp. 17\u201351. Springer, Boston (2009). https:\/\/doi.org\/10.1007\/978-0-387-88735-7_2"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Sinha, A., Wellman, M.: Towards the science of security and privacy in machine learning. In: Proceedings of IEEE EuroS&P, April 2018","DOI":"10.1109\/EuroSP.2018.00035"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Wu, X., Jha, S., Swami, A.: Distillation as a defense to adversarial perturbations against deep neural networks. In: Proceedings of IEEE S&P, May 2016","DOI":"10.1109\/SP.2016.41"},{"key":"5_CR39","unstructured":"Perdomo, J.C., Singer, Y.: Robust attacks against multiple classifiers, CoRR (2019)"},{"key":"5_CR40","unstructured":"Pinot, R., Ettedgui, R., Rizk, G., Chevaleyre, Y., Atif, J.: Randomization matters. how to defend against strong adversarial attacks. In: Proceedings of ICML (2020)"},{"key":"5_CR41","first-page":"43","volume":"30","author":"J Pita","year":"2009","unstructured":"Pita, J., et al.: Using game theory for Los Angeles airport security. AI Mag. 30, 43\u201357 (2009)","journal-title":"AI Mag."},{"key":"5_CR42","unstructured":"Schlenker, A., et al.: Deceiving cyber adversaries: a game theoretic approach. In: Proceedings of AAMAS, pp. 892\u2013900 (2018)"},{"key":"5_CR43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"key":"5_CR44","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume":"10","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: Monte Carlo sampling methods. Handbooks Oper. Res. Manag. Sci. 10, 353\u2013425 (2003)","journal-title":"Handbooks Oper. Res. Manag. Sci."},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Sommer, R., Paxson, V.: Outside the closed world: on using machine learning for network intrusion detection. In: Proceedings of IEEE S&P (2010)","DOI":"10.1109\/SP.2010.25"},{"key":"5_CR46","unstructured":"Thomas, K., McCoy, D., Grier, C., Kolcz, A., Paxson, V.: Trafficking fraudulent accounts: the role of the underground market in twitter spam and abuse. In: Proceedings of USENIX Security, pp. 195\u2013210 (2013)"},{"key":"5_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88735-7","volume-title":"Machine Learning in Cyber Trust: Security, Privacy, and Reliability","year":"2009","unstructured":"Tsai, J.J.P., Yu, P.S. (eds.): Machine Learning in Cyber Trust: Security, Privacy, and Reliability. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-0-387-88735-7"},{"key":"5_CR48","unstructured":"ULB. Credit card fraud detection (2013). https:\/\/www.kaggle.com\/mlg-ulb\/creditcardfraud\/version\/3"},{"issue":"2\u20133","key":"5_CR49","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1021814225969","volume":"24","author":"B Verweij","year":"2003","unstructured":"Verweij, B., Ahmed, S., Kleywegt, A.J., Nemhauser, G., Shapiro, A.: The sample average approximation method applied to stochastic routing problems: a computational study. Comput. Optim. Appl. 24(2\u20133), 289\u2013333 (2003). https:\/\/doi.org\/10.1023\/A:1021814225969","journal-title":"Comput. Optim. Appl."},{"key":"5_CR50","doi-asserted-by":"crossref","unstructured":"Vorobeychik, Y., Kantarcioglu, M.: Adversarial Machine Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool (2018)","DOI":"10.2200\/S00861ED1V01Y201806AIM039"},{"key":"5_CR51","unstructured":"Wang, G., Wang, T., Zheng, H., Zhao, B.Y.: Man vs. machine: practical adversarial detection of malicious crowdsourcing workers. In: Proceedings of USENIX Security, pp. 239\u2013254 (2014)"},{"key":"5_CR52","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Kantarcioglu, M.: Adversarial learning with Bayesian hierarchical mixtures of experts. In: Proceedings of SIAM SDM, pp. 929\u2013937 (2014)","DOI":"10.1137\/1.9781611973440.106"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Kantarcioglu, M., Thuraisingham, B., Xi, B.: Adversarial support vector machine learning. In: Proceedings of KDD, pp. 1059\u20131067 (2012)","DOI":"10.1145\/2339530.2339697"},{"key":"5_CR54","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of ICML, pp. 928\u2013936 (2003)"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90370-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T05:22:35Z","timestamp":1673673755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90370-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030903695","9783030903701"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90370-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GameSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Decision and Game Theory for Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.gamesec-conf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}