{"title":"Hyperplane separation technique for multidimensional mean-payoff games","_id":"717","department":[{"_id":"KrCh"}],"date_created":"2018-12-11T11:48:07Z","date_updated":"2023-02-23T10:38:15Z","month":"09","page":"236 - 259","volume":88,"year":"2017","type":"journal_article","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"first_name":"Yaron","full_name":"Velner, Yaron","last_name":"Velner"}],"acknowledgement":"The research was supported by Austrian Science Fund (FWF) Grant No. P 23499-N23, FWF NFN Grant No. S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), Microsoft faculty fellows award, the RICH Model Toolkit (ICT COST Action IC0901), and was carried out in partial fulfillment of the requirements for the Ph.D. degree of the second author.","oa_version":"Preprint","oa":1,"publication_status":"published","intvolume":"        88","quality_controlled":"1","publication":"Journal of Computer and System Sciences","day":"01","ec_funded":1,"status":"public","date_published":"2017-09-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1210.3141"}],"project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"doi":"10.1016/j.jcss.2017.04.005","scopus_import":1,"citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” <i>Journal of Computer and System Sciences</i>, vol. 88, Academic Press, 2017, pp. 236–59, doi:<a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">10.1016/j.jcss.2017.04.005</a>.","ista":"Chatterjee K, Velner Y. 2017. Hyperplane separation technique for multidimensional mean-payoff games. Journal of Computer and System Sciences. 88, 236–259.","apa":"Chatterjee, K., &#38; Velner, Y. (2017). Hyperplane separation technique for multidimensional mean-payoff games. <i>Journal of Computer and System Sciences</i>. Academic Press. <a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">https://doi.org/10.1016/j.jcss.2017.04.005</a>","short":"K. Chatterjee, Y. Velner, Journal of Computer and System Sciences 88 (2017) 236–259.","ama":"Chatterjee K, Velner Y. Hyperplane separation technique for multidimensional mean-payoff games. <i>Journal of Computer and System Sciences</i>. 2017;88:236-259. doi:<a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">10.1016/j.jcss.2017.04.005</a>","ieee":"K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” <i>Journal of Computer and System Sciences</i>, vol. 88. Academic Press, pp. 236–259, 2017.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.” <i>Journal of Computer and System Sciences</i>. Academic Press, 2017. <a href=\"https://doi.org/10.1016/j.jcss.2017.04.005\">https://doi.org/10.1016/j.jcss.2017.04.005</a>."},"publisher":"Academic Press","publist_id":"6963","abstract":[{"text":"We consider finite-state and recursive game graphs with multidimensional mean-payoff objectives. In recursive games two types of strategies are relevant: global strategies and modular strategies. Our contributions are: (1) We show that finite-state multidimensional mean-payoff games can be solved in polynomial time if the number of dimensions and the maximal absolute value of weights are fixed; whereas for arbitrary dimensions the problem is coNP-complete. (2) We show that one-player recursive games with multidimensional mean-payoff objectives can be solved in polynomial time. Both above algorithms are based on hyperplane separation technique. (3) For recursive games we show that under modular strategies the multidimensional problem is undecidable. We show that if the number of modules, exits, and the maximal absolute value of the weights are fixed, then one-dimensional recursive mean-payoff games under modular strategies can be solved in polynomial time, whereas for unbounded number of exits or modules the problem is NP-hard.","lang":"eng"}],"related_material":{"record":[{"status":"public","id":"2329","relation":"earlier_version"}]},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}