Related papers: Baire spaces and infinite games

We show that under some general conditions the finite memory determinacy of a class of two-player win/lose games played on finite graphs implies the existence of a Nash equilibrium built from finite memory strategies for the corresponding…

A separable Banach space $X$ is said to be finitely determined if for each separable space $Y$ such that $X$ is finitely representable (f.r.) in $Y$ and $Y$ is f.r. in $X$ then $Y$ is isometric to $X$. We provide a direct proof (without…

We study infinite asymptotic games in Banach spaces with an F.D.D. and prove that analytic games are determined by characterising precisely the conditions for the players to have winning strategies. These results are applied to characterise…

It is shown that if every projective set of reals is Lebesgue measurable and has the property of Baire, if every projective set in the plane has a projective uniformization, and if Steel's K exists, then J^K_{\omega_1} \models "there are…

In this paper we study continuous-time two-player zero-sum optimal switching games on a finite horizon. Using the theory of doubly reflected BSDEs with interconnected barriers, we show that this game has a value and an equilibrium in the…

Something is definitely wrong. If the game has a linear winning strategy, then it is tractable. What's going on? Well, we describe a two-person game which has a definite winner, that is, a player who can force a win in a finite number of…

In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each position, called a game value. A game (ruleset) is called universal…

In set theory without the axiom of regularity, we consider a game in which two players choose in turn an element of a given set, an element of this element, etc.; a player wins if its adversary cannot make any next move. Sets that are…

In~[1],authors considered a general finite horizon model of dynamic game of asymmetric information, where N players have types evolving as independent Markovian process, where each player observes its own type perfectly and actions of all…

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

Pursuing a new approach to the study of infinite games in combinatorics, we introduce the categories $\mathbf{Game}_{A}$ and $\mathbf{Game}_{B}$ and improve some classical results concerning topological games related to the duality between…

We prove some consistency results concerning the Moving Off Property for locally compact spaces and thus the question of whether their function spaces are Baire.

The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…

We present a new variant of the potential game and show that certain compact subsets of $\R^n$, including a large class of self-affine sets, are winning in our game. We prove that sets with sufficiently strong winning conditions are…

Much progress has been made in misere game theory using the technique of restricted misere play, where games can be considered equivalent inside a restricted set of games without being equal in general. This paper provides a survey of…

The set of continuous or Baire class 1 functions defined on a metric space $X$ is endowed with the natural pointwise partial order. We investigate how the possible lengths of well-ordered monotone sequences (with respect to this order)…

In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…

Consider a game where Alice generates an integer and Bob wins if he can factor that integer. Traditional game theory tells us that Bob will always win this game even though in practice Alice will win given our usual assumptions about the…

Let $S$ be the set of those $\alpha\in\omega_2$ that have cofinality $\omega_1$. It is consistent relative to a measurable that the nonempty player wins the pressing down game of length $\omega_1$, but not the Banach Mazur game of length…

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…