Non-determinacy of the cut-and-choose game on a Bernstein subset of the double arrow space

From papers

Let B[0,1]B\subset [0,1] be a Bernstein set, and let A\mathbb{A} denote the double arrow space. Define

Y={(x,1)A:xB}.Y=\{(x,1)\in \mathbb{A}:x\in B\}.

Non-determinacy problem. The game Gω(Y,A)G_{\omega}(Y,\mathbb{A}) is not determined.

This asks whether neither player has a winning strategy in the specified cut-and-choose game; the supplied context does not state whether the problem is solved or remains open.

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

Lucas Chiozini, Tamás Csernák and Lajos Soukup, “Cut-and-choose games in topological spaces”, arXiv:2510.05754 (2026).

Solutions 0

No solutions have been posted yet.