{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:57:01Z","timestamp":1726055821073},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030324292"},{"type":"electronic","value":"9783030324308"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32430-8_32","type":"book-chapter","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T15:05:48Z","timestamp":1571843148000},"page":"542-562","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["When Players Affect Target Values: Modeling and Solving Dynamic Partially Observable Security Games"],"prefix":"10.1007","author":[{"given":"Xinrun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Tambe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Bo\u0161ansk\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,23]]},"reference":[{"key":"32_CR1","unstructured":"Basilico, N., Gatti, N., Amigoni, F.: Leader-follower strategies for robotic patrolling in environments with arbitrary topologies. In: AAMAS, pp. 57\u201364 (2009)"},{"key":"32_CR2","unstructured":"Blum, A., Haghtalab, N., Procaccia, A.D.: Learning optimal commitment to overcome insecurity. In: NIPS, pp. 1826\u20131834 (2014)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-68711-7_11","volume-title":"Decision and Game Theory for Security","author":"V Bucarey","year":"2017","unstructured":"Bucarey, V., Casorr\u00e1n, C., Figueroa, \u00d3., Rosas, K., Navarrete, H., Ord\u00f3\u00f1ez, F.: Building real stackelberg security games for border patrols. In: Rass, S., An, B., Kiekintveld, C., Fang, F., Schauer, S. (eds.) GameSec 2017. LNCS, vol. 10575, pp. 193\u2013212. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68711-7_11"},{"issue":"4","key":"32_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics. Auton. Robots 31(4), 299\u2013316 (2011)","journal-title":"Auton. Robots"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1613\/jair.4027","volume":"48","author":"F Fang","year":"2013","unstructured":"Fang, F., Jiang, A.X., Tambe, M.: Protecting moving targets with multiple mobile resources. JAIR 48, 583\u2013634 (2013)","journal-title":"JAIR"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Fang, F., et al.: Deploying PAWS: field optimization of the protection assistant for wildlife security. In: AAAI, pp. 3966\u20133973 (2016)","DOI":"10.1609\/aaai.v30i2.19070"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Gan, J., An, B., Vorobeychik, Y., Gauch, B.: Security games on a plane. In: AAAI, pp. 530\u2013536 (2017)","DOI":"10.1609\/aaai.v31i1.10614"},{"key":"32_CR8","unstructured":"Gan, J., Elkind, E., Wooldridge, M.: Stackelberg security games with multiple uncoordinated defenders. In: AAMAS, pp. 703\u2013711 (2018)"},{"key":"32_CR9","unstructured":"Halvorson, E., Conitzer, V., Parr, R.: Multi-step multi-sensor hider-seeker games. In: IJCAI, pp. 159\u2013166 (2009)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Haskell, W.B., Kar, D., Fang, F., Tambe, M., Cheung, S., Denicola, E.: Robust protection of fisheries with compass. In: AAAI, pp. 2978\u20132983 (2014)","DOI":"10.1609\/aaai.v28i2.19018"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-319-47413-7_25","volume-title":"Decision and Game Theory for Security","author":"K Hor\u00e1k","year":"2016","unstructured":"Hor\u00e1k, K., Bo\u0161ansk\u00fd, B.: A point-based approximate algorithm for one-sided partially observable pursuit-evasion games. In: Zhu, Q., Alpcan, T., Panaousis, E., Tambe, M., Casey, W. (eds.) GameSec 2016. LNCS, vol. 9996, pp. 435\u2013454. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47413-7_25"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Hor\u00e1k, K., Bosansk\u00fd, B., Pechoucek, M.: Heuristic search value iteration for one-sided partially observable stochastic games. In: AAAI, pp. 558\u2013564 (2017)","DOI":"10.1609\/aaai.v31i1.10597"},{"key":"32_CR13","unstructured":"Jain, M., Korzhyk, D., Van\u011bk, O., Conitzer, V., P\u011bchou\u010dek, M., Tambe, M.: A double oracle algorithm for zero-sum security games on graphs. In: AAMAS, pp. 327\u2013334 (2011)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Johnson, M.P., Fang, F., Tambe, M.: Patrol strategies to maximize pristine forest area. In: AAAI, pp. 295\u2013301 (2012)","DOI":"10.1609\/aaai.v26i1.8161"},{"key":"32_CR15","unstructured":"Kar, D., et al.: Cloudy with a chance of poaching: adversary behavior modeling and forecasting with real-world poaching data. In: AAMAS, pp. 159\u2013167 (2017)"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-04645-2_23","volume-title":"Algorithmic Game Theory","author":"J Letchford","year":"2009","unstructured":"Letchford, J., Conitzer, V., Munagala, K.: Learning and approximating the optimal strategy to commit to. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 250\u2013262. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04645-2_23"},{"key":"32_CR17","unstructured":"Marecki, J., Tesauro, G., Segal, R.: Playing repeated Stackelberg games with unknown opponents. In: AAMAS, pp. 821\u2013828 (2012)"},{"key":"32_CR18","unstructured":"McMahan, H.B., Gordon, G.J., Blum, A.: Planning in the presence of cost functions controlled by an adversary. In: ICML, pp. 536\u2013543 (2003)"},{"key":"32_CR19","unstructured":"Paruchuri, P., Pearce, J.P., Marecki, J., Tambe, M., Ordonez, F., Kraus, S.: Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games. In: AAMAS, pp. 895\u2013902 (2008)"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1609\/aimag.v30i1.2173","volume":"30","author":"J Pita","year":"2009","unstructured":"Pita, J., et al.: Using game theory for Los Angeles airport security. AI Mag. 30(1), 43 (2009)","journal-title":"AI Mag."},{"key":"32_CR21","unstructured":"Shieh, E., et al.: PROTECT: a deployed game theoretic system to protect the ports of the united states. In: AAMAS, pp. 13\u201320 (2012)"},{"key":"32_CR22","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. Cambridge University Press, Cambridge (2011)"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Tsai, J., Yin, Z., Kwak, J., Kempe, D., Kiekintveld, C., Tambe, M.: Urban security: game-theoretic resource allocation in networked physical domains. In: AAAI, pp. 881\u2013886 (2010)","DOI":"10.1609\/aaai.v24i1.7612"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Varakantham, P., Lau, H.C., Yuan, Z.: Scalable randomized patrolling for securing rapid transit networks. In: IAAI, pp. 1563\u20131568 (2013)","DOI":"10.1609\/aaai.v27i2.19002"},{"issue":"5","key":"32_CR25","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TRA.2002.804040","volume":"18","author":"R Vidal","year":"2002","unstructured":"Vidal, R., Shakernia, O., Kim, H.J., Shim, D.H., Sastry, S.: Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation. IEEE Trans. Robot. Autom. 18(5), 662\u2013669 (2002)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Vorobeychik, Y., An, B., Tambe, M., Singh, S.P.: Computing solutions in infinite-horizon discounted adversarial patrolling games. In: ICAPS, pp. 314\u2013322 (2014)","DOI":"10.1609\/icaps.v24i1.13614"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Yin, Y., An, B., Jain, M.: Game-theoretic resource allocation for protecting large public events. In: AAAI, pp. 826\u2013834 (2014)","DOI":"10.1609\/aaai.v28i1.8794"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32430-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T11:25:36Z","timestamp":1664709936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32430-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030324292","9783030324308"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32430-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 October 2019","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":"Stockholm","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/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":"47","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":"21","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":"11","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":"45% - 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.5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}