{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:36:19Z","timestamp":1720200979973},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:00:00Z","timestamp":1579910400000},"content-version":"vor","delay-in-days":1485,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61472369"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1016\/j.tcs.2015.10.015","type":"journal-article","created":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T18:35:53Z","timestamp":1445711753000},"page":"63-82","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["A logical characterization of extensive games with short sight"],"prefix":"10.1016","volume":"612","author":[{"given":"Chanjuan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Fenrong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[]},{"given":"Enqiang","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2015.10.015_br0010","series-title":"AAMAS","first-page":"805","article-title":"Short sight in extensive games","author":"Grossi","year":"2012"},{"issue":"2\u20134","key":"10.1016\/j.tcs.2015.10.015_br0020","first-page":"281","article-title":"A modal characterization of Nash equilibrium","volume":"57","author":"Harrenstein","year":"2003","journal-title":"Fund. Inform."},{"key":"10.1016\/j.tcs.2015.10.015_br0030","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.entcs.2011.10.019","article-title":"An epistemic logic of extensive games","volume":"278","author":"Lorini","year":"2011","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2015.10.015_br0040","series-title":"Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, vol. 1","first-page":"152","article-title":"Preferences in game logics","author":"Van Otterloo","year":"2004"},{"key":"10.1016\/j.tcs.2015.10.015_br0050","series-title":"Annals of Discrete Mathematics","first-page":"111","article-title":"The logic of games and its applications","author":"Parikh","year":"1985"},{"issue":"3","key":"10.1016\/j.tcs.2015.10.015_br0060","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1023\/A:1015534111901","article-title":"Extensive games as process models","volume":"11","author":"Benthem","year":"2002","journal-title":"J. Log. Lang. Inf."},{"key":"10.1016\/j.tcs.2015.10.015_br0070","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference","first-page":"49","article-title":"Dynamic logic on games with structured strategies","author":"Ramanujam","year":"2008"},{"key":"10.1016\/j.tcs.2015.10.015_br0080","series-title":"Branching time logic, perfect information games and backward induction","author":"Bonanno","year":"2003"},{"key":"10.1016\/j.tcs.2015.10.015_br0090","series-title":"A Course in Game Theory","author":"Osborne","year":"1994"},{"key":"10.1016\/j.tcs.2015.10.015_br0100","series-title":"Game Theory","author":"Fudenberg","year":"1991"},{"issue":"1","key":"10.1016\/j.tcs.2015.10.015_br0110","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Nash","year":"1950","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"1","key":"10.1016\/j.tcs.2015.10.015_br0120","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/S0899-8256(05)80015-6","article-title":"Backward induction and common knowledge of rationality","volume":"8","author":"Aumann","year":"1995","journal-title":"Games Econom. Behav."},{"issue":"5\u20136","key":"10.1016\/j.tcs.2015.10.015_br0130","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/malq.19630090502","article-title":"Semantical analysis of modal logic, I: normal modal propositional calculi","volume":"9","author":"Kripke","year":"1963","journal-title":"Z. Math. Log. Grundl. Math."},{"key":"10.1016\/j.tcs.2015.10.015_br0140","article-title":"Modal Logic for Open Minds","author":"Benthem","year":"2010"},{"key":"10.1016\/j.tcs.2015.10.015_br0150","series-title":"Modal Logic","author":"Blackburn","year":"2001"},{"issue":"4","key":"10.1016\/j.tcs.2015.10.015_br0160","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.2307\/1911197","article-title":"Rationalizable strategic behavior and the problem of perfection","volume":"52","author":"Pearce","year":"1984","journal-title":"Econometrica"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515008981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397515008981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T21:05:22Z","timestamp":1579899922000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397515008981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":16,"alternative-id":["S0304397515008981"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2015.10.015","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A logical characterization of extensive games with short sight","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2015.10.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}