In this talk we will consider various classes of games played on graphs with the classical objectives that are studied in the theory of verification. We will present a survey of results for various different classes of game graphs and show how more general class of games leads to more complicated results. We will start with some basic and fundamental results in game theory on graphs, and then show how they can be generalized to more different class of games.
