{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:22:43Z","timestamp":1743128563228,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031263682"},{"type":"electronic","value":"9783031263699"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26369-9_7","type":"book-chapter","created":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T12:43:17Z","timestamp":1675860197000},"page":"129-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synchronization in\u00a0Security Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2821-2489","authenticated-orcid":false,"given":"Stefan","family":"Rass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2881-4519","authenticated-orcid":false,"given":"Sandra","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,9]]},"reference":[{"key":"7_CR1","unstructured":"Ambrus, A.: Continuous-time games with asynchronous moves: theory and applications (2011). https:\/\/grantome.com\/grant\/NSF\/SES-1123759"},{"key":"7_CR2","unstructured":"Ambrus, A., Ishii, Y.: Asynchronous choice in battle of the sexes games: unique equilibrium selection for intermediate levels of patience (2011). https:\/\/public.econ.duke.edu\/~aa231\/Bos_6.pdf"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Ambrus, A., Ishii, Y.: On asynchronicity of moves and coordination (2015). https:\/\/doi.org\/10.2139\/ssrn.2584631","DOI":"10.2139\/ssrn.2584631"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Avenhaus, R., von Stengel, B., Zamir, S.: Inspection games: 51. In: Aumann, R.J., Hart, S. (eds.) Handbook of Game Theory with Economic Applications, Handbook of Game Theory with Economic Applications, vol. 3, pp. 1947\u20131987. Elsevier (2002)","DOI":"10.1016\/S1574-0005(02)03014-X"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-32430-8_6","volume-title":"Decision and Game Theory for Security","author":"N Boumkheld","year":"2019","unstructured":"Boumkheld, N., Panda, S., Rass, S., Panaousis, E.: Honeypot type selection games for smart grid networks. In: Alpcan, T., Vorobeychik, Y., Baras, J.S., D\u00e1n, G. (eds.) GameSec 2019. LNCS, vol. 11836, pp. 85\u201396. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32430-8_6"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Cai, Y., Daskalakis, C.: On minmax theorems for multiplayer games. In: Proceedings of the the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 217\u2013234. SIAM (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.20","DOI":"10.1137\/1.9781611973082.20"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jet.2019.05.005","volume":"183","author":"PK Dutta","year":"2019","unstructured":"Dutta, P.K., Siconolfi, P.: Asynchronous games with transfers: uniqueness and optimality. J. of Econ. Theory 183, 46\u201375 (2019). https:\/\/doi.org\/10.1016\/j.jet.2019.05.005","journal-title":"J. of Econ. Theory"},{"key":"7_CR8","unstructured":"Eaton, J.W., Bateman, D., Hauberg, S., Wehbring, R.: GNU Octave version 6.1.0 manual: a high-level interactive language for numerical computations (2020). https:\/\/www.gnu.org\/software\/octave\/doc\/v6.1.0\/"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.geb.2020.06.006","volume":"123","author":"C Ewerhart","year":"2020","unstructured":"Ewerhart, C., Valkanova, K.: Fictitious play in networks. Games Econom. Behav. 123, 182\u2013206 (2020). https:\/\/doi.org\/10.1016\/j.geb.2020.06.006","journal-title":"Games Econom. Behav."},{"key":"7_CR10","volume-title":"The Theory of Learning in Games","author":"D Fudenberg","year":"1998","unstructured":"Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-90370-1_3","volume-title":"Decision and Game Theory for Security","author":"T Kroupa","year":"2021","unstructured":"Kroupa, T., Vannucci, S., Votroubek, T.: Separable network games with compact strategy sets. In: Bo\u0161ansk\u00fd, B., Gonzalez, C., Rass, S., Sinha, A. (eds.) GameSec 2021. LNCS, vol. 13061, pp. 37\u201356. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90370-1_3"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econom. Behav. 14(1), 124\u2013143 (1996). https:\/\/doi.org\/10.1006\/game.1996.0044","journal-title":"Games Econom. Behav."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-92185-1_59","volume-title":"Internet and Network Economics","author":"N Nisan","year":"2008","unstructured":"Nisan, N., Schapira, M., Zohar, A.: Asynchronous best-reply dynamics. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol. 5385, pp. 531\u2013538. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92185-1_59"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Pawlick, J., Nguyen, T.T.H., Colbert, E., Zhu, Q.: Optimal timing in dynamic and robust attacker engagement during advanced persistent threats. In: 2019 17th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), pp. 1\u20136. IEEE (2019)","DOI":"10.23919\/WiOPT47501.2019.9144123"},{"key":"7_CR15","unstructured":"Pedroso, J.P.: Numerical solution of Nash and Stackelberg equilibria: an evolutionary approach (2008). https:\/\/www.dcc.fc.up.pt\/~jpp\/publications\/PDF\/nash-es.pdf"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-319-68711-7_26","volume-title":"Decision and Game Theory for Security","author":"S Rass","year":"2017","unstructured":"Rass, S., K\u00f6nig, S., Schauer, S.: On the cost of game playing: how to control the expenses in mixed strategies. In: Rass, S., An, B., Kiekintveld, C., Fang, F., Schauer, S. (eds.) GameSec 2017. LNCS, pp. 494\u2013505. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68711-7_26"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47413-7","volume-title":"Decision and Game Theory for Security","year":"2016","unstructured":"Zhu, Q., Alpcan, T., Panaousis, E., Tambe, M., Casey, W. (eds.): GameSec 2016. LNCS, vol. 9996. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47413-7"},{"key":"7_CR18","unstructured":"Wen, Q.: Repeated games with asynchronous moves. undefined (2002). https:\/\/paper\/Repeated-Games-with-Asynchronous-Moves-Wen\/10f0f9c55f4f0b0024000b9709b9ad60cd3a346b"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Wu, C.W.: Synchronization in complex networks of nonlinear dynamical systems. World Scientific, New Jersey (2007). oCLC: ocn170923077","DOI":"10.1142\/6570"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Yoon, K.: The effective minimax value of asynchronously repeated games. Int. J. Game Theory 32(4), 431\u2013442 (2004). https:\/\/doi.org\/10.1007\/s001820300161, https:\/\/link.springer.com\/10.1007\/s001820300161","DOI":"10.1007\/s001820300161"},{"key":"7_CR21","unstructured":"Young, R.D.: Press-dyson analysis of asynchronous, sequential prisoner\u2019s dilemma. arXiv:1712.05048 [physics] (2017). https:\/\/arxiv.org\/abs\/1712.05048, arXiv: 1712.05048"}],"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-031-26369-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T13:06:26Z","timestamp":1675861586000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26369-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031263682","9783031263699"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26369-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 February 2023","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":"PIttsburgh, PA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2022","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":"39","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":"15","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":"38% - 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":"3","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)"}}]}}