13 problems
An ordinal definable game of length on natural numbers with real parameters is a game in which the payoff and defining data are ordinal definable, with real parameters a…
Let be the game of continuously coded length, where is a partial function from reals to natural numbers and is a payoff set of sequences…
Let be a separable Banach space, let be Borel, and let be the auxiliary game referred to in the paper, with denoting the c…
Let be a separable Banach space over , let be Borel and Aronszajn-null, and let be the game in which player ch…
Let be a subtree, and write … For and , consider win-lose alternating-move games on with payoff set…
Let denote the axiom of determinacy and let denote the axiom of Blackwell determinacy. Martin's conjecture.…
ETOG representation conjecture. Every bi-positional prefix-independent winning condition coincides on periodic sequences with some energy condition over a totally ordered group.
Kopczyński's conjecture. Prefix-independent half-positional winning conditions are closed under finite unions.
Consider infinite Hex on the triangular lattice, with Red and Blue claiming unoccupied board positions according to the usual rules, but with a board position containing finitely m…
Horizontal initial-position conjecture. A game of Infinite Hex with initial position as in figure is a win for Red.
Red's one-tile advantage conjecture. A game of Infinite Hex with exactly one tile of the board assigned to Red at the initial position, and none to Blue, is a win for Red.
Let be a cardinal and let . In the multiboard Gale–Stewart game … the players play the ordinary Gale–Stewart game on boards s…
Let be a topological space, let be the least cardinality of a -base for , and let denote the Banach–Mazur game on . For positive card…