const int k; // time bound

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

// each player wants to maximise the expected number of messages sent in k steps
// (with players 1 and 2 forming a coalition)
<<p1,p2:p3>>max=? (R{"r12"}[C<=k] + R{"r3"}[C<=k])