Related papers: Guess the Larger Number
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…
Taking the absolute value of consecutive differences of a cyclicly ordered list of integers constitutes a simple dynamical system. For lists of lenght a power of two the process will terminate in all zeros, but examples with arbitarily long…
We introduce a way to compare actions in decision problems. One action is safer than another if the set of beliefs at which the decision-maker prefers the safer action expands as the decision-maker becomes more risk averse. We provide a…
In this paper, we study a game with positive or plus infinite expectation and determine the optimal proportion of investment for maximizing the limit expectation of growth rate per attempt. With this objective, we introduce a new pricing…
In robot games on Z, two players add integers to a counter. Each player has a finite set from which he picks the integer to add, and the objective of the first player is to let the counter reach 0. We present an exponential-time algorithm…
We study an alternating sum involving factorials and Stirling numbers of the first kind. We give an exponential generating function for these numbers and show they are nonnegative and enumerate the number of increasing trees on $n$ vertices…
We study sums of arithmetic functions, defined on Gaussian integers and taken over those pairs of integers whose coordinates give rise to a singular system.
We study a recently introduced two-person combinatorial game, the $(a,b)$-monochromatic clique transversal game which is played by Alice and Bob on a graph $G$. As we observe, this game is equivalent to the $(b,a)$-biased Maker-Breaker game…
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore…
In Problem #1542 of Mathematics Magazine, Grossman and Turett define the Cantor game. In his 2007 Mathematics Magazine article about the Cantor game, Matt Baker proves several results and poses three challenging questions about it: Do there…
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set.…
The ability of a deterministic, plastic system to learn to imitate stochastic behavior is analyzed. Two neural networks -actually, two perceptrons- are put to play a zero-sum game one against the other. The competition, by acting as a kind…
We study two models of the Majority problem. We are given n balls and an unknown coloring of them with two colors. We can ask sets of balls of size k as queries, and in the so-called General Model the answer to a query shows if all the…
In this paper we quantize the Card Game. In the classical version of this game, one player (Alice) can always win with propability 2/3. But when the other player (Bob) is allowed to apply quantum strategy, the original unfair game turns…
The domatic game with pallete size $k$ is a $2$-player game played on a graph $G$ recently introduced by Hartnell and Rall. Players Alice and Bob take turns choosing an uncolored vertex from $G$, and coloring it a color from…
After the social learning models were proposed, finding the solutions of the games becomes a well-defined mathematical question. However, almost all papers on the games and their applications are based on solutions built upon either an…
Infinite games (in the form of Gale-Stewart games) are studied where a play is a sequence of natural numbers chosen by two players in alternation, the winning condition being a subset of the Baire space $\omega^\omega$. We consider such…
Discuss several tricks for solving twenty question problems which in this paper is depicted as a guessing game. Player tries to find a ball in twenty boxes by asking as few questions as possible, and these questions are answered by only…
Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…
We prove game-theoretic generalizations of some well known zero-one laws. Our proofs make the martingales behind the laws explicit, and our results illustrate how martingale arguments can have implications going beyond measure-theoretic…