dc.contributor.author Nain, SumitVardi, Moshe Y. 2014-11-21T21:50:13Z 2014-11-21T21:50:13Z 2013 Nain, Sumit and Vardi, Moshe Y.. "Solving Partial-Information Stochastic Parity Games." LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, (2013) Association for Computing Machinery: 341-348. http://dx.doi.org/10.1109/LICS.2013.40. https://hdl.handle.net/1911/78492 We study one-sided partial-information 2-player concurrent stochastic games with parity objectives. In such a game, one of the players has only partial visibility of the state of the game, while the other player has complete knowledge. In general, such games are known to be undecidable, even for the case of a single player (POMDP). These undecidability results depend crucially on player strategies that exploit an infinite amount of memory. However, in many applications of games, one is usually more interested in finding a finitememory strategy. We consider the problem of whether the player with partial information has a finite-memory winning strategy when the player with complete information is allowed to use an arbitrary amount of memory. We show that this problem is decidable. eng Association for Computing Machinery This is an author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by the Association for Computing Machinery. Solving Partial-Information Stochastic Parity Games Conference paper LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science 28th Annual ACM/IEEE Symposium on Logic in Computer Science 2013 Text http://dx.doi.org/10.1109/LICS.2013.40 post-print 341 348
﻿