The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies

October 17, 2017 in by

by Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi
Reference:
Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS’14), pages 242-257. Volume 8412 of Lecture Notes in Computer Science. Springer, April 2014.
Bibtex Entry:
@string{apr="April"}
@inproceedings{CDNV-fossacs14,
  address =       {Grenoble, France},
  author =        {Chatterjee, Krishnendu and Doyen, Laurent and
                   Nain, Sumit and Vardi, Moshe Y.},
  booktitle =     {{P}roceedings of the 17th {I}nternational
                   {C}onference on {F}oundations of {S}oftware {S}cience
                   and {C}omputation {S}tructures ({FoSSaCS}'14)},
  editor =        {Muscholl, Anca},
  month =         apr,
  pages =         {242-257},
  publisher =     {Springer},
  series =        {Lecture Notes in Computer Science},
  title =         {The Complexity of Partial-Observation Stochastic
                   Parity Games with Finite-Memory Strategies},
  volume =        {8412},
  year =          {2014},
  doi =           {10.1007/978-3-642-54830-7_16},
  url =           {http://www.cassting-project.eu/wp-content/uploads/
                  CDNV-fossacs14.pdf},
  category =      {conf},
  wps =           {wp1},
  partners =      {CNRS},
  casstingpart =  {50},
}