{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:38:48Z","timestamp":1723016328187},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>We study Stackelberg Security Games where the defender, in addition to allocating defensive resources to protect targets from the attacker, can strategically manipulate the attacker\u2019s payoff under budget constraints in weighted L^p-norm form regarding the amount of change. For the case of weighted L^1-norm constraint, we present (i) a mixed integer linear program-based algorithm with approximation guarantee; (ii) a branch-and-bound based algorithm with improved efficiency achieved by effective pruning; (iii) a polynomial time approximation scheme for a special but practical class of problems. In addition, we show that problems under budget constraints in L^0 and weighted L^\\infty-norm form can be solved in polynomial time.<\/jats:p>","DOI":"10.24963\/ijcai.2018\/71","type":"proceedings-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:49:10Z","timestamp":1530755350000},"page":"512-518","source":"Crossref","is-referenced-by-count":1,"title":["Designing the Game to Play: Optimizing Payoff Structure in Security Games"],"prefix":"10.24963","author":[{"given":"Zheyuan Ryan","family":"Shi","sequence":"first","affiliation":[{"name":"Swarthmore College, USA"}]},{"given":"Ziye","family":"Tang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Long","family":"Tran-Thanh","sequence":"additional","affiliation":[{"name":"University of Southampton, UK"}]},{"given":"Rohit","family":"Singh","sequence":"additional","affiliation":[{"name":"World Wide Fund for Nature, Cambodia"}]},{"given":"Fei","family":"Fang","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]}],"member":"10584","event":{"number":"27","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2018","name":"Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}","start":{"date-parts":[[2018,7,13]]},"theme":"Artificial Intelligence","location":"Stockholm, Sweden","end":{"date-parts":[[2018,7,19]]}},"container-title":["Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:49:40Z","timestamp":1530755380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2018\/71"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2018\/71","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}