The large-canopy dimension conjecture for alternating-move games
The large-canopy dimension conjecture for alternating-move games
Let be a subtree, and write
d=\dim_{\mathcal{H}}\left(\left\llbracket T\right\rrbracket\right).For and , consider win-lose alternating-move games on with payoff sets contained in \left\llbracket T\right\rrbracket. Large-canopy dimension conjecture. There exist sets W,W^I,W^{II}\subseteq\left\llbracket T\right\rrbracket such that
where is non-determined, Player I can guarantee a win in the game , and Player II can guarantee a win in the game . This would extend the analogous result for the full tree to subtrees whose canopies have Hausdorff dimension greater than , while the preceding examples show that the conclusion can fail when the canopy has dimension at most .
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Itamar Bellaïche and Auriel Rosenzweig, “Determining the Winner in Alternating-Move Games”, arXiv:2601.08359 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.