Related papers: Evasion numbers via zero-prediction

This paper focuses on a kind of linear quadratic non-zero sum differential game driven by backward stochastic differential equation with asymmetric information, which is a natural continuation of Wang and Yu [IEEE TAC (2010) 55: 1742-1747,…

We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…

We prove the consistency of $\mathrm{add}(\mathcal{N})<\mathrm{cov}(\mathcal{N})<\mathfrak{p}=\mathfrak{g}=\mathfrak{s}<\mathrm{add}(\mathcal{M})=\mathrm{cof}(\mathcal{M})<\mathfrak{a}=\mathrm{non}(\mathcal{N})=\mathfrak{c}$ with ZFC where…

This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…

We study the coupling of bouncing-ball modes to chaotic modes in two-dimensional billiards with two parallel boundary segments. Analytically, we predict the corresponding decay rates using the fictitious integrable system approach.…

We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a…

A temporal-theoretic formalism for understanding game theory is described where a strict ordering relation on a set of time points $T$ defines a game on $T$. Using this formalism, a proof of Zermelo's Theorem, which states that every finite…

Consider the following hat guessing game. A bear sits on each vertex of a graph $G$, and a demon puts on each bear a hat colored by one of $h$ colors. Each bear sees only the hat colors of his neighbors. Based on this information only, each…

Using examples we test formulae previously conjectured to give the fractal information dimension of chaotic repellors and their stable and unstable manifolds in ``typical'' dynamical systems in terms of the Lyapunov exponents and the…

A geometric approach to differential game theory is illustrated. The parallel pursuit is considered as a two-player zero-sum differential game. The optimal strategies of each player is designed based on Riemann-Finsler geometry. Our…

This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…

Many real-world multi-agent or multi-task evaluation scenarios can be naturally modelled as normal-form games due to inherent strategic (adversarial, cooperative, and mixed motive) interactions. These strategic interactions may be agentic…

Bayesian regression games are a special class of two-player general-sum Bayesian games in which the learner is partially informed about the adversary's objective through a Bayesian prior. This formulation captures the uncertainty in regard…

The laws of chance are often subtle and deceptive. This is why games of chance work. People are convinced that they obey seemingly intuitive laws, while the underlying mathematical structure reveals a different and more complex reality.…

Given the univariate marginals of a real-valued, continuous-time martingale, (respectively, a family of measures parameterised by $t \in [0,T]$ which is increasing in convex order, or a double continuum of call prices) we construct a family…

We consider zero-sum stochastic differential games with possibly path-dependent controlled state. Unlike the previous literature, we allow for weak solutions of the state equation so that the players' controls are automatically of feedback…

We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…

We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps. We show that the four…

Large language models can score well on named game-theory benchmarks while failing on the same strategic computation once semantic cues are removed. We show this gap with procedurally generated zero-sum matrix games: a model that recognizes…

This article presents the variant of the approach introduced in the recent work of Bensoussan, Wong, Yam and Yuan [13] to the generic first-order mean field game problem. A major contribution here is the provision of new crucial a priori…