// each players want to minimise the probability of sending s messages
<<p1:p2>>max=?(P[F sent1=smax] + P[F sent2=smax])

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

// one bounded and one unbounded
<<p1:p2>>max=?(P[F<=k sent1=smax] + P[F sent2=smax])