Related papers: Mind the gap: A real-valued distance on combinator…
We derive various sharp bounds on moments of the distance between two independent random vectors taking values in a Banach space.
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown…
Subtraction games are a class of impartial combinatorial games whose positions correspond to nonnegative integers and whose moves correspond to subtracting one of a fixed set of numbers from the current position. Though they are easy to…
We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff…
The remoteness from a simple game to a weighted game can be measured by the concept of the dimension or the more general Boolean dimension. It is known that both notions can be exponential in the number of voters. For complete simple games…
We address the numerical approximation of Mean Field Games with local couplings. For power-like Hamiltonians, we consider both unconstrained and constrained stationary systems with density constraints in order to model hard congestion…
We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives…
Matthew Baker investigated, in previous work, an elegant, infinite-length game that may be used to study subsets of real numbers. We present two accessible examples of how an important technique from set theory, or a different technique…
Two selection games from the literature, $G_c(\mathcal O,\mathcal O)$ and $G_1(\mathcal O_{zd},\mathcal O)$, are known to characterize countable dimension among certain spaces. This paper studies their perfect- and limited-information…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
In this paper we will discuss scoring play games. We will give the basic definitions for scoring play games, and show that they form a well defined set, with clear and distinct outcome classes under these definitions. We will also show that…
The set of badly approximable numbers, Bad, is known to be winning for Schmidt's game and hence has full Hausdorff dimension. It is also known that the set of inhomogeneously badly approximable numbers has full dimension. We prove that the…
This study presents a quantitative framework to compare teams in collective sports with respect to their style of play. The style of play is characterized by the team's spatial distribution over a collection of frames. As a first step, we…
Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…
Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-defender games. In this paper we review these three perspectives in a coalgebraic setting, which allows us to generalize from the particular branching…
In the second section, we introduce dense unital magmas and show that a near-ring is dense if and only if it has a positive element smaller that unity. In the third section, we discuss magma-valued metric spaces. The density property of the…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…
Cauchy's formula was originally established for random straight paths crossing a body $B \subset \mathbb{R}^{n}$ and basically relates the average chord length through $B$ to the ratio between the volume and the surface of the body itself.…