const int k;

// each players want to minimise the probability of sending s messages
// p2 and p3 in coalition
<<p1:p2,p3>>max=? (P[F sent1=smax] + P[F sent2+sent3=2*smax])

// each players want to minimise the probability of sending s messages within t steps
// p2 and p3 in coalition
<<p1:p2,p3>>max=? (P[F<=k sent1=smax] + P[F<=k sent2+sent3=2*smax])

// one bounded and one unbounded
// p2 and p3 in coalition
<<p1:p2,p3>>max=? (P[F<=k sent1=smax] + P[F sent2+sent3=2*smax])

// one bounded and one unbounded
// p2 and p3 in coalition
<<p1:p2,p3>>max=? (P[F sent1=smax] + P[F<=k sent2+sent3=2*smax])