{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T20:24:09Z","timestamp":1759091049826},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255090"},{"type":"electronic","value":"9783642255106"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25510-6_2","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:51:09Z","timestamp":1322661069000},"page":"13-24","source":"Crossref","is-referenced-by-count":4,"title":["Approximation Algorithm for Security Games with Costly Resources"],"prefix":"10.1007","author":[{"given":"Sayan","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Conitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1978721.1978729","volume":"10","author":"B. An","year":"2011","unstructured":"An, B., Pita, J., Shieh, E., Tambe, M., Kiekintveld, C., Marecki, J.: GUARDS and PROTECT: next generation applications of security games. ACM SIGecom Exchanges\u00a010(1), 31\u201334 (2011)","journal-title":"ACM SIGecom Exchanges"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Chen, X., Deng, X.: Settling the complexity of two-player Nash equilibrium. In: FOCS, pp. 261\u2013272 (2006)","DOI":"10.1109\/FOCS.2006.69"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The complexity of computing a Nash equilibrium. In: STOC, pp. 71\u201378 (2006)","DOI":"10.1145\/1132516.1132527"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1287\/moor.7.4.515","volume":"7","author":"G. Dobson","year":"1982","unstructured":"Dobson, G.: Worst-case analysis of greedy heuristics for integer programming with nonnegative data. Mathematics of Operations Research\u00a07(4), 515\u2013531 (1982)","journal-title":"Mathematics of Operations Research"},{"issue":"6","key":"2_CR5","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput.\u00a039(6), 2531\u20132597 (2010)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set-cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1997)","DOI":"10.1145\/261342.571216"},{"key":"2_CR8","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, pp. 689\u2013696 (2009)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Korzhyk, D., Conitzer, V., Parr, R.: Complexity of computing optimal Stackelberg strategies in security resource allocation games. In: AAAI, pp. 805\u2013810 (2010)","DOI":"10.1609\/aaai.v24i1.7638"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming\u00a014(1), 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1609\/aimag.v30i1.2173","volume":"30","author":"J. Pita","year":"2009","unstructured":"Pita, J., Jain, M., Ord\u00f3\u00f1ez, F., Portway, C., Tambe, M., Western, C.: Using game theory for Los Angeles Airport security. AI Magazine\u00a030(1), 43\u201357 (2009)","journal-title":"AI Magazine"},{"key":"2_CR12","unstructured":"Pita, J., Jain, M., Western, C., Portway, C., Tambe, M., Ord\u00f3\u00f1ez, F., Kraus, S., Parachuri, P.: Deployed ARMOR protection: The application of a game-theoretic model for security at the Los Angeles International Airport. In: AAMAS - Industry and Applications Track, pp. 125\u2013132 (2008)"},{"key":"2_CR13","unstructured":"Tsai, J., Rathi, S., Kiekintveld, C., Ord\u00f3\u00f1ez, F., Tambe, M.: IRIS - a tool for strategic security allocation in transportation. In: AAMAS - Industry Track, pp. 37\u201344 (2009)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25510-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T10:07:29Z","timestamp":1686478049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25510-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255090","9783642255106"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25510-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}