Chatterjee, KrishnenduHenzinger, Thomas A.2012-03-012012-03-012012-03-01201210.1016/j.jcss.2011.05.002https://infoscience.epfl.ch/handle/20.500.14299/78272WOS:000299719100002We summarize classical and recent results about two-player games played on graphs with omega-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications. (C) 2011 Elsevier Inc. All rights reserved.Game theoryStochastic gamesomega-Regular objectivesMarkov Decision-ProcessesParity GamesStrategy ImprovementInfinite GamesStreett GamesMuller GamesMu-CalculusComplexityInformationGraphstext::journal::journal article::research article