Related papers: A game on partial orderings

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…

We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…

We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge of the suffix of the input word still to be read. We show…

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

Assume $\mathsf{ZF}+\mathsf{AD}+V=L(\mathbb{R})$ and let $\kappa<\Theta$ be an uncountable cardinal. We show that $\kappa$ is J\'onsson, and that if $\mathrm{cof}(\kappa)=\omega$ then $\kappa$ is Rowbottom. We also establish some other…

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…

Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

Does the class of linear orders have (one of the variants of) the so called (lambda, kappa)-limit model? It is necessarily unique, and naturally assuming some instances of G.C.H. we get some positive, i.e. existence results. More generally,…

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

We discuss partial specifications in first-order logic FO and also in a Turing-complete extension of FO. We compare the compositional and game-theoretic approaches to the systems.

Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…

Given an uncountable regular cardinal $\kappa$, a partial order is $\kappa$-stationarily layered if the collection of regular suborders of $\mathbb{P}$ of cardinality less than $\kappa$ is stationary in $\mathcal{P}_\kappa(\mathbb{P})$. We…

Let $G$ be a finite non-abelian group and $\kappa_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $\kappa_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure…

The games G_2 and G_3 are played on a complete Boolean algebra B in \omega-many moves. At the beginning White picks a non-zero element p of B and, in the n-th move, White picks a positive p_n < p and Black chooses an i_n belonging to {0,1}.…

We answer a variant of a question of Rodl and Voigt by showing that, for a given infinite cardinal lambda, there is a graph G of cardinality kappa =(2^lambda)^+ such that for any colouring of the edges of G with lambda colours, there is an…

The principle of open determinacy for class games---two-player games of perfect information with plays of length $\omega$, where the moves are chosen from a possibly proper class, such as games on the ordinals---is not provable in…

In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…

We analyse the computational complexity of finding Nash equilibria in turn-based stochastic multiplayer games with omega-regular objectives. We show that restricting the search space to equilibria whose payoffs fall into a certain interval…