Recursive Markov Decision Processes and Recursive Simple Stochastic Game es

We can see an example source code of a RSSG with its transition graph on the fig. 2. The specification of an RSSG is the same as for an RMC except that any entries, internal nodes or box-exits can be preceded by the name of the player(min or max) in square brackets eg. [max] L1 {...} makes the internal node L1 be controlled by the maximizer. On the transition graph drawing nodes controlled by the maximizer are painted red, while the nodes controlled by the minimizer are painted blue and the random nodes are black as for the RMCs.

Figure 2: Source code of an example Recursive Simple Stochastic Game and its underlying transition graph

A formal grammar of the input language for Recursive Markov Decision Processes and Recursive Simple Stochastic Game es is defined in 4.2.