{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:12Z","timestamp":1742913372867,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642252792"},{"type":"electronic","value":"9783642252808"}],"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-25280-8_9","type":"book-chapter","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T13:12:36Z","timestamp":1320844356000},"page":"87-103","source":"Crossref","is-referenced-by-count":1,"title":["Network Games with and without Synchroneity"],"prefix":"10.1007","author":[{"given":"Ahmad Termimi Ab","family":"Ghani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuyuki","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Ahmad Termimi, A.G., Tanaka, K.: Network Games with Many Attackers and Defenders. In: Proceedings of Research Institute for Mathematical Sciences (RIMS) K\u00f4ky\u00fbroku, vol.\u00a01729, pp. 146\u2013151. Kyoto University (2011)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Blackwell, D.: Infinite G \u03b4 games with imperfect information. In: Zastosowania Matematyki Applicationes Mathematicae, Hugo Steinhaus Jubilee, vol.\u00a0X, pp. 99\u2013101 (1969)","DOI":"10.4064\/am-10-1-99-101"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Gelastou, M., Mavronicholas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.: The Power of the Defender. In: CD-ROM Proceedings of the 2nd International Workshop on Incentive-Based Computing (July 2006)","DOI":"10.1109\/ICDCSW.2006.107"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc.\u00a010, 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: The determinacy of Blackwell games. Journal Symbolic Logic\u00a063(4), 1565\u20131581 (1998)","journal-title":"Journal Symbolic Logic"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11602613_30","volume-title":"Algorithms and Computation","author":"M. Mavronicholas","year":"2005","unstructured":"Mavronicholas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: A Network Game with Attacker and Protector Entities. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 288\u2013297. Springer, Heidelberg (2005)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1007\/11600930_98","volume-title":"Internet and Network Economics","author":"M. Mavronicolas","year":"2005","unstructured":"Mavronicolas, M., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: A Graph-Theoretic Network Security Game. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 969\u2013978. Springer, Heidelberg (2005)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/11821069_62","volume-title":"Mathematical Foundations of Computer Science 2006","author":"M. Mavronicolas","year":"2006","unstructured":"Mavronicolas, M., Michael, L., Papadopoulou, V.G., Philippou, A., Spirakis, P.G.: The Price of Defense. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 717\u2013728. Springer, Heidelberg (2006)"},{"key":"9_CR9","unstructured":"Ould-MedSalem, M., Manoussakis, Y., Tanaka, K.: A Game on Graphs with Many non-Centralized Defenders. In: 22nd European Conference on Operations Research (EURO XXII), Prague, July 8-11 (2007)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences\u00a036, 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Noncooperative Games. Annals of Maths\u00a054, 286\u2013295 (1951)","journal-title":"Annals of Maths"},{"key":"9_CR12","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25280-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T05:31:23Z","timestamp":1560922283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25280-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642252792","9783642252808"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25280-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}