Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results for banach mazur game
Search options not deleted
2 votes

Looking for a mathematically rigorous introduction to game theory

Besides Game Theory for Social Sciences (von Neumann, Morgenstern, Nash) and Nim-like Games (Berlekamp, Conway, Guy) there are at least three more flavors of game theory. … Infinitely Long Discrete Games or "Polish games" introduced by Mazur, Banach, Ulam, Steinhaus, Mycielski, with applications to descriptive set theory and general topology. …
bof's user avatar
  • 13.4k
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$. … The Banach-Mazur game on $\mathbb P$ is $\omega$-strategically closed when there is a strategy $\sigma$ such that II wins whenever II plays according to $\sigma$, meaning if the sequence of plays so far …
3 votes
Accepted

Strategic vs. tactical closure

Now, if $\tau$ was a winning tactic for II in the Banach-Mazur game on $\mathbb P$, there would be a different way to define $\prec$ with properties 1.-5.: let $q\prec p$ iff $q < \tau(p)$. …
Andreas Lietz's user avatar
7 votes
0 answers
229 views

Is this equivalent to (some version of) Hechler forcing?

Intuitively, a sufficiently $\mathbb{P}$-generic filter yields a sufficiently good stationary Banach-Mazur strategy for player $2$ (and both stationarity and player-$2$-winning are appropriately WLOG here … There is some set $A\subseteq\omega^\omega$ whose Banach-Mazur game $G_{BM}(A)$ is determined such that any winning strategy for $G_{BM}(A)$ computes $\alpha$. …
11 votes

Strategic vs. tactical closure

The answer to the topological version of Banach-Mazur games is negative, proved by Gabriel Debs in 1985: Debs, Gabriel, Stratégies gagnantes dans certains jeux topologiques (Winning strategies in certain … www.impan.pl/en/publishing-house/journals-and-series/fundamenta-mathematicae/all/126/1/104687/strategies-gagnantes-dans-certains-jeux-topologiques The paper is in French, but here is the MathScinet review: A Banach-Mazur
Joel David Hamkins's user avatar
5 votes

Strategic vs. tactical closure

In this paper, we look at a conjecture of Telgarsky concerning the topological Banach-Mazur game. … It is interesting to me that the same principle used to resolve this conjecture for the topological Banach-Mazur game seems so relevant to Monroe's question for the poset Banach-Mazur game. …
Martin Sleziak's user avatar
1 vote

Strategic vs. tactical closure

As JDH observed, there are topological spaces $X$ for which Player II has a winning strategy (and in fact a winning 2-tactic), but no winning tactic in the topological Banach-Mazur game. … It remains to be shown that winning strategies in the poset game produce winning strategies in the topological game. …
Steven Clontz's user avatar
6 votes

Strategic vs. tactical closure

Suppose Player II has a winning strategy $\sigma$ in the BanachMazur game on a poset $P$. …
bof's user avatar
  • 13.4k
7 votes

Strategic vs. tactical closure

player I's move in that game, compute the response $r$ of $\sigma$ to that play, and then extend $r$ to a chosen condition $r^+$ whose label codes the sequence $p^{\to},q$. … $\Box$ This answer amounts to the partial-order analogue of the Debs result I mentioned in my other answer, which he proved for the topological Banach-Mazur games. …
Joel David Hamkins's user avatar
6 votes
0 answers
113 views

Reverse mathematics of Banach-Mazur games

Given $\mathcal{A}\subseteq\omega^\omega$, the Banach-Mazur game with payoff set $\mathcal{A}$ consists of players $1$ and $2$ alternately playing nonempty finite strings of naturals with player $1$ winning … On the other hand, Banach-Mazur determinacy principles are relatively weak on a set-theoretic level: "Every Banach-Mazur game is determined" adds no consistency strength to $\mathsf{ZF+DC}$. …
2 votes
0 answers
196 views

A question about infinite product of Baire and meager spaces

Kunen), then, using the Banach-Mazur game, Player I has a winning strategy in $\textsf{BM}(X^{\omega})$. … I was trying to show that Player I has a winning strategy in the game $\textsf{MB}(X^{\kappa})$, but unfortunately I still haven't got it. …
5 votes
1 answer
602 views

Banach-Mazur game and infinite products

strategy in $\textsf{BM} (\prod_{i\in I}X_{i}, \prod_{i\in I} \tau_{i} ).$ Where $\textsf{BM}(X)$ denotes the Banach-Mazur game played on a topological space $X$. … Remember that The Banach-Mazur game on $X$, $\textsf{BM}(X)$, is played as follows: Players I and II play an inning per positive integer. …
2 votes
0 answers
162 views

Banach–Mazur game and mappings

Player $II$ wins the run $\langle U_0, V_0, U_1, V_1, \dots \rangle$ of the Banach-Mazur game on $X$ iff $\bigcap_{n\in\omega}V_n \not = \emptyset$. … Is there a description of the class of spaces in which $II$ has a winning strategy in the Banach-Mazur game, in terms of continuous maps? …
2 votes
1 answer
172 views

Question about almost locally ccc and the Krom space

The Banach-Mazur game (or Choquet game) played on $X$ and the Banach-Mazur game played on $\mathcal{K}(X)$ are equivalents. …
10 votes
0 answers
293 views

Undetermined Banach-Mazur games: beyond DC

So we can separately ask: Version 2: Does ZF prove "There is an un-quasidetermined Banach-Mazur game?" … Version 3: Is the statement "Every Banach-Mazur game is weakly determined" consistent with ZF? …

15 30 50 per page