{"month":"03","date_created":"2018-12-12T11:39:13Z","type":"technical_report","citation":{"chicago":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>.","ista":"Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.","ieee":"K. Chatterjee and L. Doyen, <i>Games with a weak adversary</i>. IST Austria, 2014.","short":"K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Games with a Weak Adversary</i>. IST Austria, 2014, doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>.","apa":"Chatterjee, K., &#38; Doyen, L. (2014). <i>Games with a weak adversary</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">https://doi.org/10.15479/AT:IST-2014-176-v1-1</a>","ama":"Chatterjee K, Doyen L. <i>Games with a Weak Adversary</i>. IST Austria; 2014. doi:<a href=\"https://doi.org/10.15479/AT:IST-2014-176-v1-1\">10.15479/AT:IST-2014-176-v1-1</a>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"IST-2014-176-v1+1_icalp_14.pdf","file_size":328253,"date_created":"2018-12-12T11:53:07Z","checksum":"1d6958aa60050e1c3e932c6e5f34c39f","access_level":"open_access","relation":"main_file","date_updated":"2020-07-14T12:46:49Z","creator":"system","content_type":"application/pdf","file_id":"5468"}],"department":[{"_id":"KrCh"}],"date_updated":"2021-01-12T08:02:03Z","publication_status":"published","year":"2014","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"}],"title":"Games with a weak adversary","_id":"5418","ddc":["000","005"],"status":"public","page":"18","date_published":"2014-03-22T00:00:00Z","oa":1,"doi":"10.15479/AT:IST-2014-176-v1-1","pubrep_id":"176","oa_version":"Published Version","day":"22","publisher":"IST Austria","related_material":{"record":[{"id":"2163","relation":"later_version","status":"public"}]},"file_date_updated":"2020-07-14T12:46:49Z","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"lang":"eng","text":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. The symmetric case of player 1 more informed than player 2 is much more complicated, and we show that already in the case where player 1 has perfect observation, memory of size non-elementary is necessary in general for reachability objectives, and the problem is decidable for safety and reachability objectives. Our results have tight connections with partial-observation stochastic games for which we derive new complexity results."}],"alternative_title":["IST Austria Technical Report"]}