{"scopus_import":"1","_id":"11402","oa":1,"publication":"Journal of Computer and System Sciences","language":[{"iso":"eng"}],"publication_status":"published","date_created":"2022-05-22T22:01:40Z","abstract":[{"text":"Fixed-horizon planning considers a weighted graph and asks to construct a path that maximizes the sum of weights for a given time horizon T. However, in many scenarios, the time horizon is not fixed, but the stopping time is chosen according to some distribution such that the expected stopping time is T. If the stopping-time distribution is not known, then to ensure robustness, the distribution is chosen by an adversary as the worst-case scenario. A stationary plan for every vertex always chooses the same outgoing edge. For fixed horizon or fixed stopping-time distribution, stationary plans are not sufficient for optimality. Quite surprisingly we show that when an adversary chooses the stopping-time distribution with expected stopping-time T, then stationary plans are sufficient. While computing optimal stationary plans for fixed horizon is NP-complete, we show that computing optimal stationary plans under adversarial stopping-time distribution can be achieved in polynomial time.","lang":"eng"}],"volume":129,"article_processing_charge":"No","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","isi":1,"department":[{"_id":"KrCh"}],"day":"01","publisher":"Elsevier","doi":"10.1016/j.jcss.2022.04.003","article_type":"original","page":"1-21","type":"journal_article","acknowledgement":"This work was partially supported by Austrian Science Fund (FWF) NFN Grant No RiSE/SHiNE S11407 and by the grant ERC CoG 863818 (ForM-SMArt).","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"external_id":{"arxiv":["1802.03642"],"isi":["000805002800001"]},"status":"public","date_updated":"2023-09-07T14:48:11Z","oa_version":"Preprint","year":"2022","ec_funded":1,"month":"11","publication_identifier":{"issn":["0022-0000"],"eissn":["1090-2724"]},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1802.03642","open_access":"1"}],"project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF","name":"Game Theory"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"title":"Graph planning with expected finite horizon","related_material":{"record":[{"id":"7402","status":"public","relation":"earlier_version"}]},"quality_controlled":"1","date_published":"2022-11-01T00:00:00Z","citation":{"ama":"Chatterjee K, Doyen L. Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. 2022;129:1-21. doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>","ieee":"K. Chatterjee and L. Doyen, “Graph planning with expected finite horizon,” <i>Journal of Computer and System Sciences</i>, vol. 129. Elsevier, pp. 1–21, 2022.","short":"K. Chatterjee, L. Doyen, Journal of Computer and System Sciences 129 (2022) 1–21.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>, vol. 129, Elsevier, 2022, pp. 1–21, doi:<a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">10.1016/j.jcss.2022.04.003</a>.","ista":"Chatterjee K, Doyen L. 2022. Graph planning with expected finite horizon. Journal of Computer and System Sciences. 129, 1–21.","apa":"Chatterjee, K., &#38; Doyen, L. (2022). Graph planning with expected finite horizon. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Graph Planning with Expected Finite Horizon.” <i>Journal of Computer and System Sciences</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.jcss.2022.04.003\">https://doi.org/10.1016/j.jcss.2022.04.003</a>."},"intvolume":"       129"}