// probability player 1 eventually sends a packet
// and player two and three form a coalition to send two packets
<<p1:p2,p3>>max=?(P[F s1=3] + P[F s2=3 & s3=3])
// should be 1.0+1.0=2.0 as can collaborate
// i.e. first one sends and then the other does afterwards as no deadline

// probability player 1 eventually sends a packet by a deadline
// and player two and three form a coalition to send two packets by a deadline
<<p1:p2,p3>>max=?(P[F (s1=3 & t<=D)] + P[F (s2=3 & s3=3 & t<=D)])

// probability player 1 eventually sends a packet by a deadline
// and player two and three form a coalition to send two packets
<<p1:p2,p3>>max=?(P[F (s1=3 & t<=D)] + P[F (s2=3 & s3=3)])

// probability player 1 eventually sends a packet
// and player two and three form a coalition to send two packets by a deadline
<<p1:p2,p3>>max=?(P[F (s1=3)] + P[F (s2=3 & s3=3 & t<=D)])