{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:06:51Z","timestamp":1755799611445,"version":"3.44.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030015534"},{"type":"electronic","value":"9783030015541"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-01554-1_25","type":"book-chapter","created":{"date-parts":[[2018,9,25]],"date-time":"2018-09-25T11:47:56Z","timestamp":1537876076000},"page":"432-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scaling-Up Stackelberg Security Games Applications Using Approximations"],"prefix":"10.1007","author":[{"given":"Arunesh","family":"Sinha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Schlenker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donnabell","family":"Dmello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Tambe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,26]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Protasi, M., Marchetti-Spaccamela, A., Gambosi, G., Crescenzi, P., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4086\/toc.2012.v008a024","volume":"8","author":"N Bansal","year":"2012","unstructured":"Bansal, N., Korula, N., Nagarajan, V., Srinivasan, A.: Solving packing integer programs via randomized rounding with alterations. Theory Comput. 8(1), 533\u2013565 (2012)","journal-title":"Theory Comput."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Bo\u0161ansk\u00fd, B., Jiang, A.X., Tambe, M., Kiekintveld, C.: Combining compact representation and incremental generation in large games with sequential strategies. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9319"},{"key":"25_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: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10023"},{"key":"25_CR5","unstructured":"Brown, N., Sandholm, T.: Safe and nested subgame solving for imperfect-information games. In: NIPS, pp. 689\u2013699 (2017)"},{"key":"25_CR6","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":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1257\/aer.103.2.585","volume":"103","author":"E Budish","year":"2013","unstructured":"Budish, E., Che, Y.K., Kojima, F., Milgrom, P.: Designing random allocation mechanisms: theory and applications. Am. Econ. Rev. 103(2), 585\u2013623 (2013)","journal-title":"Am. Econ. Rev."},{"key":"25_CR8","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Dependent randomized rounding for matroid polytopes and applications. arXiv preprint arXiv:0909.4348 (2009)"},{"key":"25_CR9","unstructured":"FAA: Airport capacity profiles (2014). https:\/\/goo.gl\/YZvzsU. Accessed 15 May 2018"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM (JACM) 53(3), 324\u2013360 (2006)","journal-title":"J. ACM (JACM)"},{"key":"25_CR11","unstructured":"Guo, Q., An, B., Vorobeychik, Y., Tran-Thanh, L., Gan, J., Miao, C.: Coalitional security games. In: AAMAS (2016)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Harsanyi, J.: Games with incomplete information played by Bayesian players, I-III part I. the basic model. Manag. Sci. 14(3) (1967)","DOI":"10.1287\/mnsc.14.3.159"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Jain, M., Karde\u015f, E., Kiekintveld, C., Tambe, M., Ord\u00f3\u00f1ez, F.: Security games with arbitrary schedules: a branch and price approach. In: AAAI, pp. 792\u2013797 (2010)","DOI":"10.1609\/aaai.v24i1.7611"},{"key":"25_CR14","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: AAMAS (2009)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Letchford, J., Conitzer, V.: Solving security games on graphs via marginal probabilities. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8688"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Morav\u010d\u00edk, M., et al.: Deepstack: expert-level artificial intelligence in heads-up no-limit poker. Science (2017)","DOI":"10.1126\/science.aam6960"},{"issue":"4","key":"25_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Schlenker, A., Brown, M., Sinha, A., Tambe, M., Mehta, R.: Get me to my gate on time: efficiently solving general-sum Bayesian threat screening games. In: ECAI, pp. 1476\u20131484 (2016)","DOI":"10.3233\/978-1-61499-672-9-1476"},{"key":"25_CR20","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, New York (2011)"},{"key":"25_CR21","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 (2010)","DOI":"10.1609\/aaai.v24i1.7612"},{"key":"25_CR22","unstructured":"USDOT: Bureau of transportation statistics (2016). https:\/\/goo.gl\/Goz84L. Accessed 15 May 2018"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Xu, H.: The mysteries of security games: equilibrium computation becomes combinatorial algorithm design. In: ACM-EC (2016)","DOI":"10.1145\/2940716.2940796"}],"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-01554-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T00:17:35Z","timestamp":1755649055000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01554-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030015534","9783030015541"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01554-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"26 September 2018","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":"Seattle, WA","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gamesec2018","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":"44","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":"28","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":"8","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":"64% - 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":"4","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":"4","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)"}},{"value":"Three of the full papers and two of the short papers were submitted to a special track on Adversarial AI.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}