Questions tagged [infinite-games]
Infinite games. Combinatorial game theory for infinite two-player games of perfect information. Open games, clopen games. Determinacy. Transfinite game values. Topological games.
76 questions
16
votes
1
answer
732
views
An infinite game played on $\{0,1\}^\mathbb{N}$ in which the players must avoid creating an algebraic dependency
This mathematical game occurred to me. It may be quite basic for experts, but it seems to lead to some interesting questions.
Turns are indexed by elements of $\mathbb{N} = \{1,2,\ldots, \}$. In turn $...
13
votes
1
answer
525
views
When determinacy pulls back
Let $f:\mathbb{R}\rightarrow\omega_1$ be the "usual" surjection (send $r$ to the ordinal coded by $r$ according to some fixed reasonable coding system if such an ordinal exists, and to $0$ ...
11
votes
0
answers
406
views
For which sets do Arthur and Nimue have a winning strategy in this game (“communicate a bit”)?
TL;DR: I define a three-player game (Arthur, Nimue, Merlin) where Nimue is shown a hidden bit $b$ chosen by Merlin and tries to communicate it to her ally Arthur, but Arthur must act computably while ...
3
votes
1
answer
305
views
In a nonempty Baire space, the first player does not have a winning strategy in the Choquet Game
Suppose $X$ is a nonempty topological space. The Choquet Game on $X$ is a two-player infinite game defined as follows. The first player choose a nonempty open subset $U_0\subseteq X$. The second ...
9
votes
0
answers
240
views
Does cocountable topology on $\mathbb{R}$ have the $2$-Markov Menger property?
References:
Applications of limited information strategies in Menger’s game by Clontz
Almost compatible functions and infinite length games by Clontz and Dow
Def. 3.7 of [1] $\mathcal{A}(\kappa)$ ...
4
votes
1
answer
170
views
Are W-spaces with countable pseudocharacter first countable?
Cross-post of a question originally asked by Almanzoris on Mathematics Stack Exchange.
A topological space $X$ is called W-space if P1 has a winning strategy at each point $x \in X$ for the following ...
9
votes
1
answer
354
views
Who wins the Scrambler-Solver game for infinitary Rubik's cubes?
Given a suitable infinitary analogue $\mathcal Q$ of the Rubik's cube (as developed below), consider the two player game played between the Scrambler and the Solver wherein the Scrambler scrambles the ...
6
votes
0
answers
199
views
A pre-Ramsey set that is not Ramsey
$\newcommand{\N}{\mathbb{N}}$
Recall that given a $A \in [\N]^\omega$ and $a \in [A]^{<\omega}$, the Ellentuck neighbourhood is defined to be:
$$
[a,A] := \{B \in [\N]^\omega : a \sqsubseteq B \...
8
votes
0
answers
191
views
Which sentences are "strategically preserved"?
Below, everything is first-order.
Say that a sentence $\varphi$ is strategically preserved iff player 2 has a winning strategy in the following game:
Players 1 and 2 alternately build a sequence of ...
12
votes
0
answers
646
views
Connection properties of a single stone on an infinite Hex board
This includes a series of questions.
One of the most typical examples is shown as the picture below.
An half-infinite Hex board with an one row of black stones. Black stones are separated by one ...
4
votes
1
answer
580
views
"Infinity": A card game based on prime factorization and a question
I have been developing a card game called "Infinity", which involves a unique play mechanic based on card interactions. In this game, each card displays a set of symbols, and players match ...
15
votes
3
answers
1k
views
Examples of concrete games to apply Borel determinacy to
I'm teaching a course on various mathematical aspects of games, and I'd like to find some examples to illustrate Borel determinacy. Open or closed determinacy is easy to motivate because it proves ...
6
votes
2
answers
369
views
Embeds in a topological W-group, or a W-space that embeds in a topological group?
In Theorem 3.11 of Tkachuk - A compact space $K$ is Corson compact if and only if $C_p(K)$ has a dense lc-scattered subspace it's shown that if a compact Hausdorff space embeds in a topological W-...
1
vote
0
answers
226
views
Are gaps and loopy games interchangeable in the Surreal Numbers?
The class of surreal numbers (commonly called $No$) is not complete: it contains gaps. Some people have studied the "Dedekind completion" of the surreal numbers in order to do limits and ...
6
votes
0
answers
245
views
Complexity of transfinite 5-in-a-row and other games
Suppose that 5-in-a-row is played on an infinite board, and after an infinite number of moves, if no one won yet and there is an empty square, the game just continues. At limit steps, it is the first ...
18
votes
1
answer
1k
views
Let $R, S$ be infinite sets. Alice and Bob will play a game over $R\times S$
Let $R, S$ be infinite sets. Alice and Bob will play a game over $R\times S$.
Alice's color is red and Bob's color is blue. In each step, for each $s\in S$, a player will choose finitely many ...
1
vote
0
answers
95
views
EF-games with scrambling
This question is motivated both by the notion of zero-knowledge proofs and by general curiosity about versions of the infinitely-long Ehrenfeucht-Fraisse game which don't trivialize (= Duplicator win ...
7
votes
0
answers
263
views
Strengthening Determinacy in constructive set theory?
Recall how games work. Let $X$ be a set (the "game space") and $\alpha$ an ordinal (the "game clock"). Alice and Bob take turns naming elements of $X$. We write them down in order ...
4
votes
2
answers
223
views
Does there exist a non-hemicompact regular space for which the 2nd player in the $K$-Rothberger game has a winning Markov strategy?
Assume spaces are regular.
A space is $\sigma$-compact if and only if the second player in the Menger game has a winning Markov strategy (relying on only the most recent move of the opponent and the ...
10
votes
0
answers
363
views
Determinacy coincidence at $\omega_1$: is CH needed?
This is a follow-up to the last part of an old MSE answer of mine. Briefly, an analogue at $\omega_1$ of Steel's equivalence between clopen and open determinacy can be proved assuming $\mathsf{CH}$, ...
2
votes
0
answers
317
views
Is determinacy of (some) very long open games consistent?
For $\varphi$ a first-order sentence in the language of set theory and $\kappa$ an ordinal, let $G_\varphi^{\kappa}$ be the game of length $\kappa$ in which players $1$ and $2$ alternately play ...
7
votes
0
answers
313
views
Is this determinacy principle consistent?
Let $\mathsf{ODet}_{\omega_1}(L(\mathbb{R}))$ be the following principle ("determinacy for simple open length-$\omega_1$ games"):
If $\kappa$ is any ordinal and $X\subseteq \kappa^{<\...
5
votes
1
answer
237
views
Are the completeness Games $G_{\lambda+1}(P)$ and $G_{\lambda^+}(P)$ equivalent for INC?
The completeness game $G_{\gamma}(P)$ for a partial order $P$ has players COM and INC play alternatingly and descendingly elements of $P$ with player INC playing first and player COM playing at limit ...
3
votes
0
answers
385
views
Poker with infinite stack size
In two-player No Limit Texas Hold 'Em (NLHE), the optimal strategy depends on the "effective stack size," that is maximum amount of money held by one of the players (in the sequel I'll just ...
17
votes
6
answers
1k
views
Strategic vs. tactical closure
The Banach-Mazur game on a poset $\mathbb P$ is the $\omega$-length game where the players alternate choosing a descending sequence $a_0 \geq b_0 \geq a_1 \geq b_1 \geq \dots$. Player II wins when ...
24
votes
2
answers
1k
views
What is the complexity of the winning condition in infinite Hex? In particular, is infinite Hex a Borel game?
Consider the game of infinite Hex, where two players Red and Blue alternately place their stones on the infinite hex grid, each aiming to create a winning configuration.
Red wins after infinite play, ...
2
votes
0
answers
176
views
Weakening of open determinacy for uncountably long games
For a cardinal $\kappa$ I'll use the phrase "$(\kappa,\kappa)$-game" to mean "two-player, perfect-information, deterministic game on $\kappa$ of length $\kappa$."
Say that a ...
3
votes
0
answers
199
views
A p-point game with infinitely many ultrafilters
The following game-theoretic characterization of p-points is well known:
Theorem A. An ultrafilter $D$ on the set $\omega$ of natural numbers is a p-point if and only if player I does not have a ...
28
votes
7
answers
7k
views
Why is game theory formulated in terms of equilibrium instead of winning strategies?
Game theory, on the outset, seems to invite the questions,
"what can I do to win" or "how do I beat my opponent?"
So many people who are not familiar with game theory look to game ...
3
votes
1
answer
256
views
Game versions of the tower number $\mathfrak t$
Let us recall that $\mathfrak t$ is the smallest cardinal $\kappa$ for which there exists a family $(T_\alpha)_{\alpha\in\kappa}$ of infinite subsets of $\omega$ such that
$\bullet$ for any ordinals $\...
6
votes
1
answer
337
views
Existence of a winning strategy in the $\boldsymbol{\Delta}_2^0$ game
Consider the following infinite perfect information game with two players (the name I gave in the title of the post it totally made up): at each round $i \in \omega$, player $\mathrm{I}$ picks a ...
25
votes
4
answers
3k
views
The Chocolatier's game: can the Glutton win with a restricted form of strategy?
I have a question about the Chocolatier's game, which I had
introduced in my recent answer to a question of Richard
Stanley.
To recap the game quickly, the Chocolatier offers up at each stage
a finite ...
15
votes
1
answer
2k
views
An infinite game possibly due to Ernst Specker
I have a vague memory of an infinite game due to Ernst Specker with
the following properties:
(1) It is a two-person perfect information game, where the players
move alternately.
(2) The possible ...
6
votes
1
answer
431
views
Are there "very narrow" undetermined games?
I'd like to close a gap left open in an old question of mine; I've tweaked the terminology to be a bit nicer.
For a (boldface) pointclass $\Gamma$ and a payoff set $G\subseteq\omega^\omega$, say that $...
2
votes
0
answers
191
views
Banach–Mazur game and mappings
The Banach-Mazur game on a nonempty space $X$ is defined as follows: two players, $I$ and $II$, alternately choose nonempty open sets
\begin{matrix}
I & U_0 && U_1 && \cdots ...
7
votes
5
answers
741
views
Reference for graduate-level text or monograph with focus on "the continuum"
I always had the dream to design a course for my graduate students like "mathematical models of the continuum". This course should cover history of real numbers, the Measure Problem, the ...
4
votes
0
answers
229
views
Infinite positions in 3D chomp
I've recently come back to investigating ordinal chomp. See A winning move for the first player in $3 \times 3 \times \omega$ Ordinal Chomp for a definition. I made a new discovery, that the position \...
10
votes
0
answers
338
views
Undetermined Banach-Mazur games: beyond DC
This question is a follow-up to this one; see that question for the definition of Banach-Mazur games. There James Hanson showed that ZF+DC proves that there is an undetermined Banach-Mazur game; ...
22
votes
1
answer
846
views
Undetermined Banach-Mazur games in ZF?
This question was previously asked and bountied on MSE, with no response. This MO question is related, but is also unanswered and the comments do not appear to address this question.
Given a ...
4
votes
1
answer
250
views
Can I win this variant of the Banach-Mazur Game?
Suppose I play the following game against the Opponent. My moves are rational numbers $p_i$ and the Opponent's moves are real numbers $\epsilon_i>0$.
On turn $n+1$ the past move sequence is $...
2
votes
1
answer
224
views
Question about almost locally ccc and the Krom space
Definition 1. A family $\mathcal{B}$ of non-empty open sets in a topological space will be called $\pi$-base (or pseudo-base) if every non-empty open set contains at least one member of $\mathcal{B}$. ...
6
votes
0
answers
246
views
Spaces where the Banach-Mazur game is undetermined
Let $X$ be a non-empty topological space. The Banach-Mazur game on $X$, $\textsf{BM}(X)$, is played as follows: Players I
and II play an inning per positive integer. In the $n$-th inning Player I ...
28
votes
2
answers
1k
views
Solution to simple mathematical game
Consider the following game (that I made up). Two players each attempt to name a target number. The first player begins by naming 1. On each subsequent turn, a player can name any larger number that ...
5
votes
1
answer
683
views
Banach-Mazur game and infinite products
Studying the article "Games that involve set theory or topology" of Marion Scheepers, I found the following result
Theorem 46 Let $\{(X_{i}, \tau_{i}) : i\in I \}$ be a family of topological spaces. ...
1
vote
0
answers
115
views
Is there a well-posed definition of game on a graph? Or a well defined category of games on graphs?
All I ever found about this were natural language rules à la Asimov's three laws of robotics. The questions are straightforward questions:
1) Is there a well-posed mathematical definition of game on ...
1
vote
0
answers
243
views
Winning strategies for a game on the natural numbers
Define $$F=\{(l_n, k_n)_{n=1}^t: t,l_n, k_n \in \mathbb{N}, l_1<\ldots <l_t, m_1<\ldots <m_t\}.$$ Suppose that I have a collection $G\subset F$, which is a set of ''good'' sequences.
...
2
votes
0
answers
224
views
An analytic game and Ramsey's theorem
Let $$P=\{(l_n, m_n)_{n=1}^t: l_n, m_n,t\in\mathbb{N}, l_1<\ldots <l_t, m_1<\ldots <m_t\}$$ and suppose that $T$ is some subset of $P$. Suppose that $T$ also has the following properties: ...
1
vote
2
answers
268
views
Convergence and winning strategies
Suppose we have a set $B\subseteq 2^\omega\times\omega^\omega$ and a sequence $(x_n)$ in $2^\omega$ such that for each $n$, Player I (the one trying to get into the payoff set) has a winning strategy ...
2
votes
1
answer
157
views
Rothberger game and Meager in itself sets
On $(\mathbb{R}, \tau)$ the euclidean space of real numbers, we define a new topology by letting $\tau^{*}=\{X\subseteq \mathbb{R}: X=\emptyset \hspace{0.1cm}\mbox{or}\hspace{0.1cm}\mathbb{R}\setminus ...
1
vote
1
answer
191
views
Is there a three valued logic whose game semantics corresponds to potentially infinite games?
Consider game trees with the following properties:
Each node in the tree is one of the following:
Verifier Choice: Has one or more children
Falsifier Choice: Has one or more children
No Choice: Has ...