This work is based on modelling dialogue as a markov decision process, formalised by a finite state space S, a finite action set A, a set of transition probabilities T and a reward function R. Using this model an optimal dialogue strategy π * is represented by a mapping between the state space and the action set.
for each state s ∈ S this mapping defines its optimal action a * s .