merged

Determinacy of Concurrent Generalised Reachability Games
Chai Joo Khang
Supervisor: Dr. Ahmad Termimi Ab Ghani
Bachelor of Science (Computational Mathematics)
School of Informatics and Applied Mathematics
In this paper, we focus on the concurrent stochastic games on graphs, more specifically
is infinite two-person games played on finite graphs with imperfect information. Firstly,
we study on the concept of generalised reachability games. Then, we study on the
determinacy the game and also the optimal and ɛ-optimal strategies in this game. We
also proved in showing the existence of memoryless and randomized ɛ-optimal strategy
for Player I and memoryless and randomized optimal strategy for Player II in any
reachability games. We are concerning to give simple expressions of value of this game
by defining a limit value and the value is same as the value of this game.
920 | UMT UNDERGRADUATE RESEARCH DAY 2018