Related papers: The generality of the zero-one laws
For one-dimensional diffusions on the half-line, we study a specific type of conditioning to avoid zero. We introduce supermartingales defined via concave functions with respect to the scale function. A conditioning is formulated through…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
We give another proof of ordinal analysis of $I\Sigma_{k}$-fragments of Peano Arithmetic which is free from cut-elimination of $\omega$-logic. Our main tool is a direct witnessing argument utilizing game notion, motivated from the realm of…
We survey recent developments in the theory of impartial combinatorial games in misere play, focusing on how the Sprague-Grundy theory of normal-play impartial games generalizes to misere play via the indistinguishability quotient…
We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…
We describe a statistical test for association of two autocorrelated time series, one of which generated randomly at each time point from a known but possibly history-dependent distribution. The null hypothesis is that at each time point,…
Probability forecasts of events are routinely used in climate predictions, in forecasting default probabilities on bank loans or in estimating the probability of a patient's positive response to treatment. Scoring rules have long been used…
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…
This paper investigates first-order game logic and first-order modal mu-calculus, which extend their propositional modal logic counterparts with first-order modalities of interpreted effects such as variable assignments. Unlike in the…
We study two-player zero-sum recursive games with a countable state space and finite action spaces at each state. When the family of $n$-stage values $\{v_n,n\geq 1\}$ is totally bounded for the uniform norm, we prove the existence of the…
In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…
We discuss the extent to which game semantics is implicit in the formalism of linear logic and in the intuitions underlying linear logic.
Game Logic is an excellent setting to study proofs-about-programs via the interpretation of those proofs as programs, because constructive proofs for games correspond to effective winning strategies to follow in response to the opponent's…
Quantitative measures of randomness in games are useful for game design and have implications for gambling law. We treat the outcome of a game as a random variable and derive a closed-form expression and estimator for the variance in the…
The zero forcing number was introduced as a combinatorial bound on the maximum nullity taken over the set of real symmetric matrices that respect the pattern of an underlying graph. The $Z_q$-forcing game is an analog to the standard zero…
Matching games is a one-to-one two sided market model introduced by Garrido-Lucero and Laraki, in which coupled agents' utilities are endogenously determined as the outcome of a strategic game. They refine the classical pairwise stability…
Game-theoretic upper expectations are joint (global) probability models that mathematically describe the behaviour of uncertain processes in terms of supermartingales; capital processes corresponding to available betting strategies.…
We announce misere-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misere quotients--commutative monoids that encode the additive structure of specific misere-play games. We also…
We offer a new proof of the classical law of large numbers for a general class of branching Markov processes based on the asymptotic behaviour of the moments developed in \cite{bmoments, gonzalez2022erratum}. Moreover, we show that the law…
Explaining why aggregated measures change is a critical challenge in data analytics that existing systems struggle to address. While current attribution methods exist, they lack a unified solution that is simultaneously general for…