Verification problems in stochastic games

The aim of the research project is to consider questions concerning games played on graphs which are not necessarily finite. These games can be played in a variety of frameworks including, but not limited to stochastic games with different kinds of specifications (eg Markov Decision Process with a counter). Types of games that will be considered will include mean payoff games, energy games and parity games amongst others.

The main objective of this project is to derive new or finer computability and complexity results concerning the aforementioned types of games. To derive these results about game specifications I will most likely employ logical, algebraic, automata theoretic and data scientific techniques.

By the end of month 4, I will produce a literature review and submit an outline proposal. At the end of the first year a First Year Review will take place. By the end of the second year I will have submitted a progress report as well as optionally a poster. During my third year I will submit a thesis outline, present my work at a seminar as well as submit a draft thesis and progress report by the end of the year, before finally submitting my thesis after three and a half years.