Skip to main content

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.

Filter by
Sorted by
Tagged with
16 votes
1 answer
732 views

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 $...
Mark Wildon's user avatar
  • 11.9k
13 votes
1 answer
525 views

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$ ...
Noah Schweber's user avatar
11 votes
0 answers
406 views

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 ...
Gro-Tsen's user avatar
  • 38.8k
3 votes
1 answer
305 views

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 ...
Joe Lamond's user avatar
  • 1,538
9 votes
0 answers
240 views

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)$ ...
Jakobian's user avatar
  • 2,389
4 votes
1 answer
170 views

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 ...
Steven Clontz's user avatar
9 votes
1 answer
354 views

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 ...
Jack Edward Tisdell's user avatar
6 votes
0 answers
199 views

$\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 \...
Clement Yung's user avatar
  • 1,713
8 votes
0 answers
191 views

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 ...
Noah Schweber's user avatar
12 votes
0 answers
646 views

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 ...
hzy's user avatar
  • 671
4 votes
1 answer
580 views

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 ...
mathoverflowUser's user avatar
15 votes
3 answers
1k views

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 ...
Gro-Tsen's user avatar
  • 38.8k
6 votes
2 answers
369 views

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-...
Steven Clontz's user avatar
1 vote
0 answers
226 views

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 ...
Farran Khawaja's user avatar
6 votes
0 answers
245 views

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 ...
Dmytro Taranovsky's user avatar
18 votes
1 answer
1k views

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 ...
Alma Arjuna's user avatar
1 vote
0 answers
95 views

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 ...
Noah Schweber's user avatar
7 votes
0 answers
263 views

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 ...
Tim Campion's user avatar
  • 66.8k
4 votes
2 answers
223 views

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 ...
Steven Clontz's user avatar
10 votes
0 answers
363 views

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}$, ...
Noah Schweber's user avatar
2 votes
0 answers
317 views

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 ...
Noah Schweber's user avatar
7 votes
0 answers
313 views

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^{<\...
Noah Schweber's user avatar
5 votes
1 answer
237 views

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 ...
Hannes Jakob's user avatar
  • 1,819
3 votes
0 answers
385 views

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 ...
Davis Yoshida's user avatar
17 votes
6 answers
1k views

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 ...
Monroe Eskew's user avatar
24 votes
2 answers
1k views

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, ...
Joel David Hamkins's user avatar
2 votes
0 answers
176 views

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 ...
Noah Schweber's user avatar
3 votes
0 answers
199 views

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 ...
Goldstern's user avatar
  • 14.6k
28 votes
7 answers
7k views

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 ...
Sin Nombre's user avatar
3 votes
1 answer
256 views

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 $\...
Taras Banakh's user avatar
  • 44.5k
6 votes
1 answer
337 views

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 ...
Lorenzo's user avatar
  • 2,308
25 votes
4 answers
3k views

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 ...
Joel David Hamkins's user avatar
15 votes
1 answer
2k views

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 ...
Richard Stanley's user avatar
6 votes
1 answer
431 views

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 $...
Noah Schweber's user avatar
2 votes
0 answers
191 views

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 ...
Smolin Vlad's user avatar
7 votes
5 answers
741 views

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 ...
Ruth-NO's user avatar
  • 125
4 votes
0 answers
229 views

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 \...
Thomas's user avatar
  • 2,871
10 votes
0 answers
338 views

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; ...
Noah Schweber's user avatar
22 votes
1 answer
846 views

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 ...
Noah Schweber's user avatar
4 votes
1 answer
250 views

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 $...
Daron's user avatar
  • 2,085
2 votes
1 answer
224 views

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}$. ...
Gabriel Medina's user avatar
6 votes
0 answers
246 views

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 ...
Gabriel Medina's user avatar
28 votes
2 answers
1k views

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 ...
cbmanica's user avatar
  • 331
5 votes
1 answer
683 views

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. ...
Gabriel Medina's user avatar
1 vote
0 answers
115 views

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 ...
IpsumPanEst's user avatar
1 vote
0 answers
243 views

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. ...
user-1's user avatar
  • 59
2 votes
0 answers
224 views

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: ...
user-1's user avatar
  • 59
1 vote
2 answers
268 views

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 ...
Iian Smythe's user avatar
  • 3,197
2 votes
1 answer
157 views

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 ...
Gabriel Medina's user avatar
1 vote
1 answer
191 views

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 ...
Christopher King's user avatar