A game on partial orderings (Q675112)

Given a regular uncountable cardinal \(\kappa\) and a partially ordered set \((P, <)\), the game \(G_\kappa (P)\) is defined as follows. A play is a length \(\kappa\) sequence \(x_0, x_1,x_2, \dots\) of subsets of \(P\) of size \(<\kappa\) such that \(x_0 \subseteq x_1 \subseteq x_2 \subseteq \dots\): first I chooses \(x_0\), then II chooses \(x_1\), then I chooses \(x_2, \dots\), then I chooses \(x_\omega\), then II chooses \(x_{\omega+1}, \dots\) II wins if and only if for every \(p\in P\), \(\{q\in \bigcup_{\alpha <\kappa} x_\alpha: q\leq p\}\) has cofinality \(<\kappa\) and \(\{q\in \bigcup_{\alpha< \kappa} x_\alpha: q\geq p\}\) has coinitiality \(<\kappa\). The main results of the paper are that (1) There is a tree \(T\) of height \(\kappa+1\) and size \(\kappa^+\) such that \(G_\kappa (T)\) is not determined; (2) There is a Boolean algebra \(B\) of size \(\kappa^+\) such that \(G_\kappa (B)\) is not determined; (3) \(\kappa^{<\kappa} =\kappa\) if and only if every linear order of size \(>\kappa\) has an increasing or decreasing \(\kappa\)-chain if and only if \(G_\kappa (L)\) is determined for every linear order \(L\).