{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T05:23:21Z","timestamp":1725773001631},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T00:00:00Z","timestamp":1443571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T00:00:00Z","timestamp":1443571200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-12-1-0550"],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-11-1-0332"],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0953756"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1101659"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1337215"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Synthese"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11229-015-0927-6","type":"journal-article","created":{"date-parts":[[2015,9,30]],"date-time":"2015-09-30T04:59:05Z","timestamp":1443589145000},"page":"689-703","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["On Stackelberg mixed strategies"],"prefix":"10.1007","volume":"193","author":[{"given":"Vincent","family":"Conitzer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,30]]},"reference":[{"issue":"1","key":"927_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00182-012-0328-8","volume":"42","author":"I Adler","year":"2013","unstructured":"Adler, I. (2013). The equivalence of linear programs and zero-sum games. International Journal of Game Theory, 42(1), 165\u2013177.","journal-title":"International Journal of Game Theory"},{"issue":"4","key":"927_CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1609\/aimag.v33i4.2401","volume":"33","author":"B An","year":"2012","unstructured":"An, B., Shieh, E., Tambe, M., Yang, R., Baldwin, C., DiRenzo, J., et al. (2012). PROTECT\u2014a deployed game theoretic system for strategic security allocation for the United States Coast Guard. AI Magazine, 33(4), 96\u2013110.","journal-title":"AI Magazine"},{"key":"927_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R Aumann","year":"1974","unstructured":"Aumann, R. (1974). Subjectivity and correlation in randomized strategies. Journal of Mathematical Economics, 1, 67\u201396.","journal-title":"Journal of Mathematical Economics"},{"key":"927_CR4","unstructured":"Chen, X., & Deng, X. (2005). Settling the complexity of 2-player Nash equilibrium. Electronic Colloquium on Computational Complexity, Report No. 150"},{"issue":"3","key":"927_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1516512.1516516","volume":"56","author":"X Chen","year":"2009","unstructured":"Chen, X., Deng, X., & Teng, S.-H. (2009). Settling the complexity of computing two-player Nash equilibria. Journal of the ACM, 56(3), 14.","journal-title":"Journal of the ACM"},{"key":"927_CR6","unstructured":"Conitzer, V., & Korzhyk, D. (2011). Commitment to correlated strategies. In Proceedings of the National Conference on Artificial Intelligence (AAAI) (pp. 632\u2013637). AAAI: San Francisco."},{"key":"927_CR7","unstructured":"Conitzer, V., & Sandholm, T. (2006). Computing the optimal strategy to commit to. In Proceedings of the ACM Conference on Electronic Commerce (EC) (pp. 82\u201390). ACM: Ann Arbor."},{"issue":"2","key":"927_CR8","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.geb.2008.02.015","volume":"63","author":"V Conitzer","year":"2008","unstructured":"Conitzer, V., & Sandholm, T. (2008). New complexity results about Nash equilibria. Games and Economic Behavior, 63(2), 621\u2013641.","journal-title":"Games and Economic Behavior"},{"key":"927_CR9","first-page":"330","volume-title":"Activity analysis of production and allocation","author":"G Dantzig","year":"1951","unstructured":"Dantzig, G. (1951). A proof of the equivalence of the programming problem and the game problem. In T. Koopmans (Ed.), Activity analysis of production and allocation (pp. 330\u2013335). New York: John Wiley & Sons."},{"key":"927_CR10","unstructured":"Daskalakis, C., & Papadimitriou, C.H. (2005). Three-player games are hard. Electronic Colloquium on Computational Complexity. Report No. 139."},{"issue":"1","key":"927_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/070699652","volume":"39","author":"C Daskalakis","year":"2009","unstructured":"Daskalakis, C., Goldberg, P., & Papadimitriou, C. H. (2009). The complexity of computing a Nash equilibrium. SIAM Journal on Computing, 39(1), 195\u2013259.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"927_CR12","first-page":"87","volume":"1","author":"J Dickhaut","year":"1991","unstructured":"Dickhaut, J., & Kaplan, T. (1991). A program for finding Nash equilibria. The Mathematica Journal, 1(4), 87\u201393.","journal-title":"The Mathematica Journal"},{"issue":"6","key":"927_CR13","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K Etessami","year":"2010","unstructured":"Etessami, K., & Yannakakis, M. (2010). On the complexity of Nash equilibria and other fixed points. SIAM Journal on Computing, 39(6), 2531\u20132597.","journal-title":"SIAM Journal on Computing"},{"key":"927_CR14","volume-title":"Game theory","author":"D Fudenberg","year":"1991","unstructured":"Fudenberg, D., & Tirole, J. (1991). Game theory. Cambridge: MIT Press."},{"key":"927_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0899-8256(89)90006-7","volume":"1","author":"I Gilboa","year":"1989","unstructured":"Gilboa, I., & Zemel, E. (1989). Nash and correlated equilibria: Some complexity considerations. Games and Economic Behavior, 1, 80\u201393.","journal-title":"Games and Economic Behavior"},{"key":"927_CR16","first-page":"191","volume":"20","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan, L. (1979). A polynomial algorithm in linear programming. Soviet Mathematics Doklady, 20, 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"927_CR17","unstructured":"Kiekintveld, C., Jain, M., Tsai, J., Pita, J., Ord\u00f3\u00f1ez, F., & Tambe, M. (2009). Computing optimal randomized resource allocations for massive security games. In Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (pp. 689\u2013696). AAMAS: Budapest."},{"issue":"2","key":"927_CR18","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1613\/jair.3269","volume":"41","author":"D Korzhyk","year":"2011","unstructured":"Korzhyk, D., Yin, Z., Kiekintveld, C., Conitzer, V., & Tambe, M. (2011). Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness. Journal of Artificial Intelligence Research, 41(2), 297\u2013327.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"927_CR19","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C Lemke","year":"1964","unstructured":"Lemke, C., & Howson, J. (1964). Equilibrium points of bimatrix games. Journal of the Society of Industrial and Applied Mathematics, 12, 413\u2013423.","journal-title":"Journal of the Society of Industrial and Applied Mathematics"},{"issue":"6","key":"927_CR20","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1007\/s10458-013-9246-9","volume":"28","author":"J Letchford","year":"2014","unstructured":"Letchford, J., Korzhyk, D., & Conitzer, V. (2014). On the value of commitment. Autonomous Agents and Multi-Agent Systems, 28(6), 986\u20131016.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"3","key":"927_CR21","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H. (1994). On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48(3), 498\u2013532.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"927_CR22","doi-asserted-by":"crossref","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. (2009). Using game theory for Los Angeles airport security. AI Magazine, 30(1), 43\u201357.","journal-title":"AI Magazine"},{"issue":"2","key":"927_CR23","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.geb.2006.03.015","volume":"63","author":"R Porter","year":"2008","unstructured":"Porter, R., Nudelman, E., & Shoham, Y. (2008). Simple search methods for finding a Nash equilibrium. Games and Economic Behavior, 63(2), 642\u2013662.","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"927_CR24","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0097539701397059","volume":"33","author":"T Roughgarden","year":"2004","unstructured":"Roughgarden, T. (2004). Stackelberg scheduling strategies. SIAM Journal on Computing, 33(2), 332\u2013350.","journal-title":"SIAM Journal on Computing"},{"key":"927_CR25","unstructured":"Sandholm, T., Gilpin, A., & Conitzer, V. (2005). Mixed-integer programming methods for finding Nash equilibria. In Proceedings of the National Conference on Artificial Intelligence (AAAI) (pp. 495\u2013501). AAAI: Pittsburgh."},{"key":"927_CR26","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1111\/j.1468-0262.2006.00667.x","volume":"74","author":"R Savani","year":"2006","unstructured":"Savani, R., & von Stengel, B. (2006). Hard-to-solve bimatrix games. Econometrica, 74, 397\u2013429.","journal-title":"Econometrica"},{"key":"927_CR27","volume-title":"The strategy of conflict","author":"TC Schelling","year":"1960","unstructured":"Schelling, T. C. (1960). The strategy of conflict. Cambridge: Harvard University Press."},{"key":"927_CR28","unstructured":"Tsai, J., Rathi, S., Kiekintveld, C., Ord\u00f3\u00f1ez, F., & Tambe, M. (2009). IRIS\u2014a tool for strategic security allocation in transportation networks. In Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS) (pp. 37\u201344). AAMAS: Budapest."},{"key":"927_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J von Neumann","year":"1928","unstructured":"von Neumann, J. (1928). Zur Theorie der Gesellschaftsspiele. Mathematische Annalen, 100, 295\u2013320.","journal-title":"Mathematische Annalen"},{"key":"927_CR30","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.geb.2009.11.008","volume":"69","author":"B von Stengel","year":"2010","unstructured":"von Stengel, B., & Zamir, S. (2010). Leadership games with convex strategy sets. Games and Economic Behavior, 69, 446\u2013457.","journal-title":"Games and Economic Behavior"},{"key":"927_CR31","doi-asserted-by":"crossref","unstructured":"Yin, Z., Jiang, A. X., Tambe, M., Kiekintveld, C., Leyton-Brown, K., Sandholm, T., et al. (2012). TRUSTS: Scheduling randomized patrols for fare inspection in transit systems using game theory. AI Magazine, 33(4), 59\u201372.","DOI":"10.1609\/aimag.v33i4.2432"}],"container-title":["Synthese"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-015-0927-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11229-015-0927-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-015-0927-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-015-0927-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T06:22:46Z","timestamp":1589437366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11229-015-0927-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,30]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["927"],"URL":"https:\/\/doi.org\/10.1007\/s11229-015-0927-6","relation":{},"ISSN":["0039-7857","1573-0964"],"issn-type":[{"value":"0039-7857","type":"print"},{"value":"1573-0964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,30]]},"assertion":[{"value":"15 December 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}