Related papers: The mathematics of Spinpossible
We consider strong law of large numbers (SLLN) in the framework of game-theoretic probability of Shafer and Vovk (2001). We prove several versions of SLLN for the case that Reality's moves are unbounded. Our game-theoretic versions of SLLN…
This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…
We provide infinitely many solutions of a Dirichlet problem on balls.
We develop a new approach to drifting games, a class of two-person games with many applications to boosting and online learning settings. Our approach involves (a) guessing an asymptotically optimal potential by solving an associated…
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…
The study of the combinatorial game Nim and its variants is rich and varied, but little is known of the game Nim with a Pass. It is Nim, but once per game a player is permitted to skip their turn but this can only be done if a nonempty pile…
This paper uses recent results on continuous-time finite-horizon optimal switching problems with negative switching costs to prove the existence of a saddle point in an optimal stopping (Dynkin) game. Sufficient conditions for the game's…
Matrix games constitute a fundamental problem of game theory and describe a situation of two players with completely conflicting interests. We show how methods from statistical mechanics can be used to investigate the statistical properties…
We propose an interpretation of the infinite sum of combinatorial games. In such an interpretation, plays involve infinite runs, but without loops. The notion of a run is quite natural, but different possibilities arises for the notion of…
We present a definition for the sum of a sequence of combinatorial games. This sum coincides with the classical sum in the case of a converging sequence of real numbers and with the infinitary natural sum in the case of a sequence of…
There are many papers written on the Two Envelopes Problem that usually study some of its variations. In this paper we will study and compare the most significant variations of the problem. We will see the correct decisions for each player…
The motion of a stone skimming over a water surface is considered. A simplified description of the collisional process of the stone with water is proposed. The maximum number of bounces is estimated by considering both the slowing down of…
We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the…
We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems)…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
An introduction and overview is given of the theory of spin glasses and its application.
This paper introduces a new class of Dynkin games, where the two players are allowed to make their stopping decisions at a sequence of exogenous Poisson arrival times. The value function and the associated optimal stopping strategy are…
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a…