Related papers: Absolutely minimal Lipschitz extension of tree-val…
In \cite{ CLEVACKTHI, CLEVACK} an attempt is made to find a comprehensive mathematical framework in which to investigate the problems of well-posedness, asymptotic analysis and parameter estimation for fully nonlinear evolutionary game…
We define an all-small ruleset, Bipass, within the framework of normal-play combinatorial games. A game is played on finite strips of black and white stones. Stones of different colors are swapped provided they do not bypass one of their…
Submodular extensions of an energy function can be used to efficiently compute approximate marginals via variational inference. The accuracy of the marginals depends crucially on the quality of the submodular extension. To identify the best…
We prove a version of the implicit function theorem for Lipschitz mappings $f:\mathbb{R}^{n+m}\supset A \to X$ into arbitrary metric spaces. As long as the pull-back of the Hausdorff content $\mathcal{H}_{\infty}^n$ by $f$ has positive…
In this article, we introduce certain kinds of computable reduction games with imperfect information. One can view such a game as an extension of the notion of Turing reduction, and generalized Weihrauch reduction as well. Based on the work…
We prove that the absolute extendability constant of a finite metric space may be determined by computing relative projection constants of certain Lipschitz-free spaces. As an application, we show that $\mbox{ae}(3)=4/3$ and…
Recent quasi-optimal error estimates for the finite element approximation of total-variation regularized minimization problems require the existence of a Lipschitz continuous dual solution. We discuss the validity of this condition and…
We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…
Mean-field games (MFG) have become significant tools for solving large-scale multi-agent reinforcement learning problems under symmetry. However, the assumption of exact symmetry limits the applicability of MFGs, as real-world scenarios…
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Lov\'asz Local Lemma which can dramatically reduce the number of edges needed in…
We study an alternating sum involving factorials and Stirling numbers of the first kind. We give an exponential generating function for these numbers and show they are nonnegative and enumerate the number of increasing trees on $n$ vertices…
A densely-defined symmetric linear map from/to a real Hilbert space extends to a self-adjoint map. Extension is expressed via Riesz representation. For a case including Friedrichs extension of a strongly monotone map, self-adjoint extension…
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…
With the aim of representing subsets of Banach spaces as an infinite series using Lipschitz functions, we study a variant of metric frames which we call Lipschitz p-approximate Schauder frames (Lipschitz p-ASFs). We characterize Lipschitz…
Despite the recent success of reinforcement learning in various domains, these approaches remain, for the most part, deterringly sensitive to hyper-parameters and are often riddled with essential engineering feats allowing their success. We…
We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…
This paper presents a universal representation of symmetric (permutation-invariant) functions with multidimensional variable-size variables. These representations help justify approximation methods that aggregate information from each…
A direct application of Zorn's Lemma gives that every Lipschitz map $f:X\subset \mathbb{Q}_p^n\to \mathbb{Q}_p^\ell$ has an extension to a Lipschitz map $\widetilde f: \mathbb{Q}_p^n\to \mathbb{Q}_p^\ell$. This is analogous, but more easy,…
We consider a deterministic game with alternate moves and complete information, of which the issue is always the victory of one of the two opponents. We assume that this game is the realization of a random model enjoying some independence…