par Hunter, Paul William 
;Perez, Guillermo A. ;Raskin, Jean-François
Référence Acta informatica, 55, 8, page (627-647)
Publication Publié, 2017
;Perez, Guillermo A. ;Raskin, Jean-François Référence Acta informatica, 55, 8, page (627-647)
Publication Publié, 2017
Article révisé par les pairs
| Résumé : | Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of full observation, they admit memoryless optimal strategies for both players and can be solved in NP∩ coNP. MPGs are suitable quantitative models for open reactive systems. However, in this context the assumption of full observation is not always realistic. For the partial-observation case, the problem that asks if the first player has an observation-based winning strategy that enforces a given threshold on the mean payoff, is undecidable. In this paper, we study the window mean-payoff objectives introduced recently as an alternative to the classical mean-payoff objectives. We show that, in sharp contrast to the classical mean-payoff objectives, some of the window mean-payoff objectives are decidable in games with partial observation. |
