{"volume":272,"intvolume":"       272","year":"2023","file_date_updated":"2023-10-09T09:19:11Z","acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the DFG Grant\r\n389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of\r\nExcellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy), and the DFG projects BA-1679/11-1 and BA-1679/12-1.","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"ddc":["000"],"publication":"48th International Symposium on Mathematical Foundations of Computer Science","has_accepted_license":"1","author":[{"full_name":"Baier, Christel","last_name":"Baier","first_name":"Christel"},{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","last_name":"Meggendorfer","first_name":"Tobias"},{"full_name":"Piribauer, Jakob","last_name":"Piribauer","first_name":"Jakob"}],"doi":"10.4230/LIPIcs.MFCS.2023.15","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959772921"]},"external_id":{"arxiv":["2307.06611"]},"conference":{"start_date":"2023-08-28","name":"MFCS: Symposium on Mathematical Foundations of Computer Science","location":"Bordeaux, France","end_date":"2023-09-01"},"citation":{"short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 48th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Entropic risk for turn-based stochastic games. In: <i>48th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15.","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Entropic Risk for Turn-Based Stochastic Games.” In <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Vol. 272. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., &#38; Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In <i>48th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">https://doi.org/10.4230/LIPIcs.MFCS.2023.15</a>","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Entropic risk for turn-based stochastic games,” in <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, Bordeaux, France, 2023, vol. 272.","mla":"Baier, Christel, et al. “Entropic Risk for Turn-Based Stochastic Games.” <i>48th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 272, 15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2023.15\">10.4230/LIPIcs.MFCS.2023.15</a>."},"ec_funded":1,"_id":"14417","article_number":"15","language":[{"iso":"eng"}],"date_created":"2023-10-09T09:21:05Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","oa":1,"scopus_import":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","quality_controlled":"1","title":"Entropic risk for turn-based stochastic games","alternative_title":["LIPIcs"],"day":"21","type":"conference","file":[{"date_updated":"2023-10-09T09:19:11Z","file_id":"14418","success":1,"date_created":"2023-10-09T09:19:11Z","file_size":826843,"relation":"main_file","checksum":"402281b17ed669bbf149d0fdf68ac201","content_type":"application/pdf","file_name":"2023_LIPIcsMFCS_Baier.pdf","access_level":"open_access","creator":"dernst"}],"date_updated":"2023-10-09T09:22:37Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_processing_charge":"Yes","month":"08","publication_status":"published","date_published":"2023-08-21T00:00:00Z","abstract":[{"lang":"eng","text":"Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective. This gives rise to an objective function that demands the control of systems in a risk-averse manner. We show that the resulting games are determined and, in particular, admit optimal memoryless deterministic strategies. This contrasts risk measures that previously have been considered in the special case of Markov decision processes and that require randomization and/or memory. We provide several results on the decidability and the computational complexity of the threshold problem, i.e. whether the optimal value of ERisk exceeds a given threshold. In the most general case, the problem is decidable subject to Shanuel’s conjecture. If all inputs are rational, the resulting threshold problem can be solved using algebraic numbers, leading to decidability via a polynomial-time reduction to the existential theory of the reals. Further restrictions on the encoding of the input allow the solution of the threshold problem in NP∩coNP. Finally, an approximation algorithm for the optimal value of ERisk is provided."}],"department":[{"_id":"KrCh"}]}