{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:16:46Z","timestamp":1743049006935,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030514655"},{"type":"electronic","value":"9783030514662"}],"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-51466-2_17","type":"book-chapter","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T13:03:46Z","timestamp":1592917426000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-Aware Uniformization of Winning Strategies"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Le Roux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"key":"17_CR1","unstructured":"Aghajohari, M., Avni, G., Henzinger, T.A.: Determinacy in discrete-bidding infinite-duration games. CoRR abs\/1905.03588 (2019). http:\/\/arxiv.org\/abs\/1905.03588"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Berthon, R., Maubert, B., Murano, A., Rubin, S., Vardi, M.Y.: Strategy logic with imperfect information. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, 20\u201323 June 2017, pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005136"},{"key":"17_CR3","unstructured":"Berwanger, D., Doyen, L.: Observation and distinction. representing information in infinite games. CoRR abs\/1809.05978 (2018). http:\/\/arxiv.org\/abs\/1809.05978"},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Strategy logic. Inf. Comput. 208(6), 677\u2013693 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.07.004","journal-title":"Inf. Comput."},{"key":"17_CR5","unstructured":"Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: 32nd IEEE Symposium on Foundations of Computer Science, pp. 368\u2013377 (1991)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF01696781","volume":"37","author":"K G\u00f6del","year":"1930","unstructured":"G\u00f6del, K.: Die vollst\u00e4ndigkeit der axiome des logischen funktionenkalk\u00fcls. Monatshefte f\u00fcr Mathematik und Physik 37(1), 349\u2013360 (1930)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC 1982, pp. 60\u201365. ACM Press (1982)","DOI":"10.1145\/800070.802177"},{"key":"17_CR8","first-page":"119","volume":"16","author":"J Hintikka","year":"1962","unstructured":"Hintikka, J.: Knowledge and belief: an introduction to the logic of the two notions. Stud. Logica 16, 119\u2013122 (1962)","journal-title":"Stud. Logica"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1073\/pnas.36.10.570","volume":"36","author":"H Kuhn","year":"1950","unstructured":"Kuhn, H.: Extensive games. Proc. Nat. Acad. Sci. 36, 570\u2013576 (1950)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Le Roux, S.: Concurrent games and semi-random determinacy. In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, UK, 27\u201331 August 2018, pp. 40:1\u201340:15 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2018.40","DOI":"10.4230\/LIPIcs.MFCS.2018.40"},{"key":"17_CR11","unstructured":"Le Roux, S.: Time-aware uniformization of winning strategies. CoRR abs\/1907.05128 (2019). http:\/\/arxiv.org\/abs\/1907.05128"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102, 363\u2013371 (1975)","journal-title":"Ann. Math."},{"issue":"01","key":"17_CR13","doi-asserted-by":"publisher","first-page":"1440004","DOI":"10.1142\/S0219198914400040","volume":"16","author":"B Maubert","year":"2014","unstructured":"Maubert, B., Pinchinat, S.: A general notion of uniform strategies. Int. Game Theory Rev. 16(01), 1440004 (2014). https:\/\/doi.org\/10.1142\/S0219198914400040","journal-title":"Int. Game Theory Rev."},{"key":"17_CR14","unstructured":"Maubert, B., Pinchinat, S., Schwarzentruber, F.: Reachability games in dynamic epistemic logic. CoRR abs\/1905.12422 (2019). http:\/\/arxiv.org\/abs\/1905.12422"},{"key":"17_CR15","unstructured":"Mostowski, A.: Games with forbidden positions. Research report 78, University of Gdansk (1991)"},{"key":"17_CR16","volume-title":"Theory of Games and Economic Behavior","author":"J Neumann","year":"1944","unstructured":"Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior. Princeton University Press, Princeton (1944)"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"MO Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3(2), 114\u2013125 (1959). https:\/\/doi.org\/10.1147\/rd.32.0114","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"JH Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. J. Comput. Syst. Sci. 29(2), 274\u2013301 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Roy, S., Ellis, C., Shiva, S.G., Dasgupta, D., Shandilya, V., Wu, Q.: A survey of game theory as applied to network security. In: 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), Proceedings, Koloa, Kauai, HI, USA, 5\u20138 January 2010, pp. 1\u201310 (2010). https:\/\/doi.org\/10.1109\/HICSS.2010.35","DOI":"10.1109\/HICSS.2010.35"},{"issue":"4","key":"17_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1111\/1467-8586.00133","volume":"53","author":"J Van Benthem","year":"2001","unstructured":"Van Benthem, J.: Games in dynamic-epistemic logic. Bull. Econ. Res. 53(4), 219\u2013248 (2001). https:\/\/doi.org\/10.1111\/1467-8586.00133","journal-title":"Bull. Econ. Res."}],"container-title":["Lecture Notes in Computer Science","Beyond the Horizon of Computability"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51466-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,9]],"date-time":"2021-03-09T18:10:02Z","timestamp":1615313402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51466-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030514655","9783030514662"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51466-2_17","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":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fisciano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 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":"cie2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cie2020.wordpress.com\/","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":"72","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":"28","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":"5","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":"39% - 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":"7","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)"}},{"value":"The conference was held virtually due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}