{"department":[{"_id":"KrCh"}],"type":"conference","publist_id":"7332","status":"public","publication":"Proceedings of GandALF 2010","scopus_import":1,"alternative_title":["EPTCS"],"volume":25,"citation":{"ama":"Cristau J, David C, Horn F. How do we remember the past in randomised strategies? . In: <i>Proceedings of GandALF 2010</i>. Vol 25. Open Publishing Association; 2010:30-39. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>","ista":"Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.","ieee":"J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in <i>Proceedings of GandALF 2010</i>, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.","mla":"Cristau, Julien, et al. “How Do We Remember the Past in Randomised Strategies? .” <i>Proceedings of GandALF 2010</i>, vol. 25, Open Publishing Association, 2010, pp. 30–39, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.7\">10.4204/EPTCS.25.7</a>.","short":"J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.","chicago":"Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .” In <i>Proceedings of GandALF 2010</i>, 25:30–39. Open Publishing Association, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>.","apa":"Cristau, J., David, C., &#38; Horn, F. (2010). How do we remember the past in randomised strategies? . In <i>Proceedings of GandALF 2010</i> (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.25.7\">https://doi.org/10.4204/EPTCS.25.7</a>"},"page":"30 - 39","oa":1,"day":"09","author":[{"full_name":"Cristau, Julien","first_name":"Julien","last_name":"Cristau"},{"last_name":"David","full_name":"David, Claire","first_name":"Claire"},{"id":"37327ACE-F248-11E8-B48F-1D18A9856A87","last_name":"Horn","full_name":"Horn, Florian","first_name":"Florian"}],"doi":"10.4204/EPTCS.25.7","_id":"489","month":"06","year":"2010","main_file_link":[{"url":"https://arxiv.org/abs/1006.1404v1","open_access":"1"}],"oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:46:45Z","date_published":"2010-06-09T00:00:00Z","language":[{"iso":"eng"}],"publication_status":"published","title":"How do we remember the past in randomised strategies? ","intvolume":"        25","publisher":"Open Publishing Association","abstract":[{"text":"Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.","lang":"eng"}],"quality_controlled":"1","conference":{"end_date":"2010-06-18","start_date":"2010-06-17","location":"Minori, Amalfi Coast, Italy","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"date_updated":"2021-01-12T08:01:01Z"}