AbstractThe article compares two different approaches of incorporating probability into coalition logics. One is based on the semantics of games with stochastic transitions and the other on games with the stochastic failures. The work gives an example of a non-trivial property of coalition power for the first approach and a complete axiomatization for the second approach. It turns out that the logical properties of the coalition power modality under the second approach depend on whether the modal language allows the empty coalition. The main technical results for the games with stochastic failures are a strong completeness theorem for the logical system without the empty coalition and an incompleteness theorem which shows that there is no strongly complete logical system in the language with the empty coalition.