Non-determinacy of the cut-and-choose game on a Bernstein subset of the double arrow space
Let be a Bernstein set, and let denote the double arrow space. Define
Non-determinacy problem. The game 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.
References
Primary source
Lucas Chiozini, Tamás Csernák and Lajos Soukup, “Cut-and-choose games in topological spaces”, arXiv:2510.05754 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.