{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:15:53Z","timestamp":1743146153171,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_31","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"444-458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bayesian Repeated Zero-Sum Games with Persistent State, with Application to Security Games"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Conitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaddin","family":"Dughmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"31_CR1","unstructured":"Abernethy, J., Bartlett, P.L., Hazan, E.: Blackwell approachability and no-regret learning are equivalent. In: Proceedings of the 24th Annual Conference on Learning Theory, pp. 27\u201346 (2011)"},{"key":"31_CR2","unstructured":"Aumann, R.J., Maschler, M.: Repeated games with incomplete information. MIT Press, Cambridge (1995)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskar, U., Cheng, Y., Ko, Y.K., Swamy, C.: Hardness results for signaling in Bayesian zero-sum and network routing games. In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 479\u2013496 (2016)","DOI":"10.1145\/2940716.2940753"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","volume":"6","author":"D Blackwell","year":"1956","unstructured":"Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pac. J. Math. 6(1), 1\u20138 (1956)","journal-title":"Pac. J. Math."},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.geb.2009.04.016","volume":"70","author":"C Borgs","year":"2010","unstructured":"Borgs, C., Chayes, J., Immorlica, N., Kalai, A.T., Mirrokni, V., Papadimitriou, C.: The myth of the folk theorem. Games Econ. Behav. 70(1), 34\u201343 (2010)","journal-title":"Games Econ. Behav."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Cheung, H.Y., Dughmi, S., Emamjomeh-Zadeh, E., Han, L., Teng, S.H.: Mixture selection, mechanism design, and signaling. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. pp. 1426\u20131445. IEEE (2015)","DOI":"10.1109\/FOCS.2015.91"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/3055589.3055591","volume":"15","author":"S Dughmi","year":"2017","unstructured":"Dughmi, S.: Algorithmic information structure design: a survey. ACM SIGecom Exchanges 15(2), 2\u201324 (2017)","journal-title":"ACM SIGecom Exchanges"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.geb.2018.08.001","volume":"118","author":"S Dughmi","year":"2019","unstructured":"Dughmi, S.: On the hardness of designing public signals. Games Econ. Behav. 118, 609\u2013625 (2019)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2994501.2994507","volume":"15","author":"F Fang","year":"2016","unstructured":"Fang, F., Nguyen, T.H.: Green security games: apply game theory to addressing green security challenges. ACM SIGecom Exchanges 15(1), 78\u201383 (2016)","journal-title":"ACM SIGecom Exchanges"},{"issue":"6","key":"31_CR10","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.1257\/aer.101.6.2590","volume":"101","author":"E Kamenica","year":"2011","unstructured":"Kamenica, E., Gentzkow, M.: Bayesian persuasion. Am. Econ. Rev. 101(6), 2590\u20132615 (2011)","journal-title":"Am. Econ. Rev."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Neumann, J.V.: Zur theorie der gesellschaftsspiele. Mathematische annalen 100(1), 295\u2013320 (1928)","DOI":"10.1007\/BF01448847"},{"key":"31_CR12","unstructured":"Rockmore, D.: What\u2019s missing from \u201cthe imitation game\u201d, November 2014. https:\/\/www.newyorker.com\/tech\/annals-of-technology\/imitation-game-alan-turing. Accessed 23 Jan 2020"},{"key":"31_CR13","unstructured":"Rubinstein, A.: Eth-hardness for signaling in symmetric zero-sum games. CoRR abs\/1510.04991 (2015)"},{"key":"31_CR14","unstructured":"Sorin, S.: A First Course on Zero-Sum Repeated Games, vol. 37. Springer, Heidelberg (2002)"},{"issue":"1\u20132","key":"31_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/game.1997.0527","volume":"21","author":"B von Stengel","year":"1997","unstructured":"von Stengel, B., Koller, D.: Team-maxmin equilibria. Games Econ. Behav. 21(1\u20132), 309\u2013321 (1997)","journal-title":"Games Econ. Behav."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Tambe, M.: Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press, Cambridge (2011)","DOI":"10.1109\/Allerton.2012.6483443"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al.: Deep reinforcement learning for green security games with real-time information. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1401\u20131408 (2019)","DOI":"10.1609\/aaai.v33i01.33011401"},{"key":"31_CR18","doi-asserted-by":"publisher","unstructured":"Xu, H., et al.: Optimal patrol planning for green security games with black-box attackers. In: Rass, S., An, B., Kiekintveld, C., Fang, F., Schauer, S. (eds.) International Conference on Decision and Game Theory for Security. GameSec 2017. Lecture Notes in Computer Science, vol. 10575, pp. 458\u2013477. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68711-7_24","DOI":"10.1007\/978-3-319-68711-7_24"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:13:51Z","timestamp":1607159631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","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":"136","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":"31","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":"23% - 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":"10","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)"}}]}}