par Hunter, Paul William 
;Pérez, Guillermo G.A.;Raskin, Jean-François
Référence Lecture notes in computer science, 8762, page (163-175)
Publication Publié, 2014
;Pérez, Guillermo G.A.;Raskin, Jean-François Référence Lecture notes in computer science, 8762, page (163-175)
Publication Publié, 2014
Article révisé par les pairs
| Résumé : | Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of perfect information. In this paper we investigate the algorithmic properties of several subclasses of mean-payoff games where the players have asymmetric information about the state of the game. These games are in general undecidable and not determined according to the classical definition. We show that such games are determined under a more general notion of winning strategy. We also consider mean-payoff games where the winner can be determined by the winner of a finite cycle-forming game. This yields several decidable classes of mean-payoff games of asymmetric information that require only finite-memory strategies, including a generalization of perfect information games where positional strategies are sufficient. We give an exponential time algorithm for determining the winner of the latter. |
