par Bruyère, Véronique;Hautem, Quentin ;Raskin, Jean-François
Référence Leibniz international proceedings in informatics, 59, 11
Publication Publié, 2016-08
Article révisé par les pairs
Résumé : We study two-player zero-sum turn-based games played on multidimensional weighted graphs with heterogeneous quantitative objectives. Our objectives are defined starting from the measures Inf, Sup, LimInf, and LimSup of the weights seen along the play, as well as on the window meanpayoff (WMP) measure recently introduced in [6]. Whereas multidimensional games with Boolean combinations of classical mean-payoff objectives are undecidable [19], we show that CNF/DNF Boolean combinations for heterogeneous measures taken among {WMP, Inf, Sup, LimInf, LimSup} lead to EXPTIME-completeness with exponential memory strategies for both players. We also identify several interesting fragments with better complexities and memory requirements, and show that some of them are solvable in PTIME.