Related papers: Absolutely minimal Lipschitz extension of tree-val…
Modal logics for reasoning about the power of coalitions capture the notion of effectivity functions associated with game forms. The main goal of coalition logics is to provide formal tools for modeling the dynamics of a game frame whose…
We present a modified version of the two-player "tug-of-war" game introduced by Peres, Schramm, Sheffield, and Wilson. This new tug-of-war game is identical to the original except near the boundary of the domain $\partial \Omega$, but its…
Let $T$ be a compact, metrisable and strongly countable-dimensional topological space. Let $\mathcal{M}^T$ be the set of all metrics $d$ on $T$ compatible with its topology, and equip $\mathcal{M}^T$ with the topology of uniform…
A well-known result is that any Lipschitz domain is an extension domain for $W^{s,p}$. This paper extends this result to Lipschitz subsets of compact Lipschitz submanifolds of $\mathbb{R}^n$. We adapt the construction of an extension…
We study a family of mean field games arising in modeling the behavior of strategic economic agents which move across space maximizing their utility from consumption and have the possibility to accumulate resources for production (such as…
Consider a standard graded artinian $k$-algebra $B$ and an extension of $B$ by a new variable, $A=B\otimes_k k[x]/(x^d)$ for some $d\geq 1$. We will show how maximal rank properties for powers of a general linear form on $A$ can be…
Suppose that ${\mathcal M}$ is a model of PA and ${\mathcal N}$ is a countably generated elementary end extension of ${\mathcal M}$. Let ${\mathfrak X}$ be the set of subsets of M that are coded by ${\mathcal N}$. Then ${\mathcal M}$ has a…
Many important real-world problems have action spaces that are high-dimensional, continuous or both, making full enumeration of all possible actions infeasible. Instead, only small subsets of actions can be sampled for the purpose of policy…
Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games,…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…
We study infinite asymptotic games in Banach spaces with an F.D.D. and prove that analytic games are determined by characterising precisely the conditions for the players to have winning strategies. These results are applied to characterise…
We introduce the notion of \pi-extension of the semigroup \mathbb{Z}_+ and study the extensions of the Toeplitz algebras by isometric operators. We show that when the action of the Toeplitz algebra is irreducible all such extensions…
There is a well-known correspondence between infinite trees and ultrametric spaces which can be interpreted as an equivalence of categories and comes from considering the end space of the tree. In this equivalence, uniformly continuous maps…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…
This paper addresses the Mountain Pass Theorem for locally Lipschitz functions on finite-dimensional vector spaces in terms of tangencies. Namely, let $f \colon \mathbb R^n \to \mathbb R$ be a locally Lipschitz function with a mountain pass…
We describe algorithms for finding the regression of t, a sequence of values, to the closest sequence s by mean squared error, so that s is always increasing (isotonicity) and so the values of two consecutive points do not increase by too…
Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to…
Nonlinear PDEs, mean value properties, and stochastic differential games are intrinsically connected. In this short expository note, we will describe how the solutions to certain PDEs (of $p$-Laplacian type) can be interpreted as limits of…
We develop game-theoretic semantics (GTS) for the fragment ATL+ of the full Alternating-time Temporal Logic ATL*, essentially extending a recently introduced GTS for ATL. We first show that the new game-theoretic semantics is equivalent to…