const int k;
// each players want to minimise the probability of sending smax messages within t steps
<>max=? (P[F<=k sent1=smax] + P[F<=k sent2=smax])
// each players want to minimise the probability of sending smax messages
<>max=? (P[F sent1=smax] + P[F sent2=smax])
// one bounded and one unbounded
<>max=? (P[F<=k sent1=smax] + P[F sent2=smax])