Algorithms for omega-regular games with imperfect information

2019-12-11 15:12

We study observationbased strategies for twoplayer turnbased games on graphs with omegaregular objectives. An observationbased strategy relies onAlgorithms for OmegaRegular Games with Incomplete Information Krishnendu Chatterjee 1 Laurent Doyen 2 Thomas A. Henzinger 1, 3 JeanFrancois Raskin 2 1 EECS, University of California at Berkeley, U. S. A. 2 CS, Universite Libre de Bruxelles, Belgium 3 CCS, Ecole Polytechnique Federale de Lausanne, Switzerland June 26, 2006 Abstract algorithms for omega-regular games with imperfect information

Abstract. We study observationbased strategies for twoplayer turnbased games on graphs with omegaregular objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations.

! regular objectives. To justify the correctness of the algorithm, we transform games of imperfect information into games of perfect information while preserving the existence of winning strategies for every Borel objective. The reduction is only part of the proof, not part of the algorithm Algorithms for OmegaRegular Games with games of imperfect information into games of perfect information while preserving the existence of winning strategies for every Borel objective. The reduction is only part of the proof, not part of the algorithm. For the special case of parityalgorithms for omega-regular games with imperfect information Algorithms for OmegaRegular Games with Imperfect Information . CSL 06, September, 2006. Abstract We study observationbased strategies for twoplayer turnbased games on graphs with omegaregular objectives. An observationbased strategy relies on imperfect information about the history of a play, namely, on the past sequence of observations.

Algorithms for omega-regular games with imperfect information free

Games with Imperfect Information: Theory and Algorithms Laurent Doyen1 and JeanFrancois Raskin2 1 LSV, ENS Cachan& CNRS, France 2 Universite Libre de Bruxelles (ULB), Belgium Abstract. We study observationbased strategies for twoplayer turnbased games played on graphs with parity objectives. algorithms for omega-regular games with imperfect information perfect information. This is optimal, as the reachability problem for games of imperfect information is known to be EXPTIMEhard [19. Second, we study randomized strategies and winning with probability 1 for imperfectinformation games. To our knowledge, for these games no algorithms (symbolic or not) are present in the literature. ALGORITHMS FOR OMEGAREGULAR GAMES WITH IMPERFECT imperfectinformation games need memory even for simple objectives such as safety and reachability (see Example 4. 4). This is again in contrast to the perfectinformation case, where turnbased safety and reachability games can be won with memoryless strategies. PDF We study observationbased strategies for twoplayer turnbased games on graphs with omegaregular objectives. An observationbased strategy relies on imperfect information about the history

Rating: 4.35 / Views: 764