Parallel strategies

We consider some combinatorial principles based on playing in parallel several two person games. For innnite games, the determinacy of the games implies these principles, but we show that they can fail for nondetermined games. We pose a question, if these principles, stated for nite games, are provable in weak axiomatic systems for arithmetic (bounded arithmetic).