const int k; // time bound

// each players want to maximise the expected number of messages sent in k steps
<<p1:p2>>max=?(R{"r1"}[C<=k] + R{"r2"}[C<=k])

// each players want to maximise the expected number of messages sent in k steps
// now player 2 is in the first coalition (will give the same result)
<<p2:p1>>max=?(R{"r2"}[C<=k] + R{"r1"}[C<=k])