Related papers: Reduction games, provability, and compactness
We present a unifying representation of computation as a two-player game between an \emph{Algorithm} and \emph{Nature}, grounded in domain theory and game theory. The Algorithm produces progressively refined approximations within a Scott…
We modify the game Fuchino, Koppelberg, and Shelah used to characterize the $\kappa$-Freese-Nation property for a given Boolean algebra $A$, replacing players I and II each with a team of $n$ players with limited information. We show that…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these…
We show that, by using multiplicative weights in a game-theoretic thought experiment (and an important convexity result on the composition of multiplicative weights with the relative entropy function), a symmetric bimatrix game (that is, a…
We propose an analytical framework for studying parallel repetition, a basic product operation for one-round two-player games. In this framework, we consider a relaxation of the value of a game, $\mathrm{val}_+$, and prove that for…
In view of the complexity of the dynamics of learning in games, we seek to decompose a game into simpler components where the dynamics' long-run behavior is well understood. A natural starting point for this is Helmholtz's theorem, which…
Oftentimes, the Shapley value becomes infeasible for games with many players. However, establishing symmetry allows for polynomial-time computation. To examine this reduction, we identify the spectrum of homogeneous group games by using an…
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning condition satisfies some simple requirement, the existence of Player 1 winning (finite-memory) strategies is equivalent to the existence of…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
The known results regarding two-player zero-sum games are naturally generalized in complex space and are presented through a complete compact theory. The payoff function is defined by the real part of the payoff function in the real case,…
We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set $\{1, 2, \dots,2N\}$. A player loses if they repeat a number…
We introduce two-player games which build words over infinite alphabets, and we study the problem of checking the existence of winning strategies. These games are played by two players, who take turns in choosing valuations for variables…
Traces form a coarse notion of semantic equivalence between states of a process, and have been studied coalgebraically for various types of system. We instantiate the finitary coalgebraic trace semantics framework of Hasuo et al. for…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
We consider one-round games between a classical referee and two players. One of the main questions in this area is the parallel repetition question: Is there a way to decrease the maximum winning probability of a game without increasing the…
We study variations of classical combinatorial games on two finite heaps of tokens, a.k.a. \emph{subtraction games}. Given non-negative integers $p_1,q_1, p_2,q_2$, where $p_1q_2 > q_1p_2$, $p_1>0$ and $q_2>0$, two players alternate in…
Lipschitz games, in which there is a limit $\lambda$ (the Lipschitz value of the game) on how much a player's payoffs may change when some other player deviates, were introduced about 10 years ago by Azrieli and Shmaya. They showed via the…
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…