Related papers: Absolutely minimal Lipschitz extension of tree-val…
We present new game semantics of Martin-L\"of type theory (MLTT) equipped with One-, Zero-, N-, Pi-, Sigma- and Id-types. Our game semantics interprets MLTT more accurately than existing ones. Another advantage of our game semantics over…
Let $F$ be a set-valued mapping which to each point $x$ of a metric space $({\mathcal M},\rho)$ assigns a convex closed set $F(x)\subset{\bf R}^2$. We present several constructive criteria for the existence of a Lipschitz selection of $F$,…
Policy Space Response Oracles (PSRO) interleaves empirical game-theoretic analysis with deep reinforcement learning (DRL) to solve games too complex for traditional analytic methods. Tree-exploiting PSRO (TE-PSRO) is a variant of this…
In this paper, we study the fundamental statistical efficiency of Reinforcement Learning in Mean-Field Control (MFC) and Mean-Field Game (MFG) with general model-based function approximation. We introduce a new concept called Mean-Field…
We consider a class of N-player stochastic games of multi-dimensional singular control, in which each player faces a minimization problem of monotone-follower type with submodular costs. We call these games "monotone-follower games". In a…
We study a tug-of-war game with varying probabilities. In particular, we show that the value of the game is locally asymptotically H\"{o}lder continuous. We also show the existence and uniqueness of values of the game. As an application, we…
Using a modification of a generalized Takagi-van der Waerden function on a metric space we prove that for any closed subset of a metric space without isolated points there exists a continuous function such that its big and local Lipschitz…
Ancestral maximum likelihood (AML) is a method that simultaneously reconstructs a phylogenetic tree and ancestral sequences from extant data (sequences at the leaves). The tree and ancestral sequences maximize the probability of observing…
Ehrenfeucht-Fraisse games are very useful in studying separation and equivalence results in logic. The standard finite Ehrenfeucht-Fraisse game characterizes equivalence in first order logic. The standard Ehrenfeucht-Fraisse game in…
We study algorithmic complexity of solving subtraction games in a~fixed dimension with a finite difference set. We prove that there exists a game in this class such that any algorithm solving the game runs in exponential time. Also we prove…
The intent of this short note is to extend real valued Lipschitz functions on metric spaces, while locally preserving the asymptotic Lipschitz constant. We then apply this results to give a simple and direct proof of the fact that Sobolev…
It is given a canonical representation of prime ends in regular spatial domains and, on this basis, it is studied the boundary behavior of the so-called lower Q-homeomorphisms that are the natural generalization of the quasiconformal…
Aim of this note is to study the infinity Laplace operator and the corresponding Absolutely Minimizing Lipschitz Extension problem on the Sierpinski gasket in the spirit of the classical construction of Kigami for the Laplacian. We…
Nearly a decade ago, Azrieli and Shmaya introduced the class of $\lambda$-Lipschitz games in which every player's payoff function is $\lambda$-Lipschitz with respect to the actions of the other players. They showed that such games admit…
In this paper, we generalize modal $\mu$-calculus to the non-distributive (lattice-based) modal $\mu$-calculus and formalize some scenarios regarding categorization using it. We also provide a game semantics for the developed logic. The…
The formulation of Mean Field Games (MFG) typically requires continuous differentiability of the Hamiltonian in order to determine the advective term in the Kolmogorov--Fokker--Planck equation for the density of players. However, in many…
We study the minimization of convex, variational integrals of linear growth among all functions in the Sobolev space $W^{1,1}$ with prescribed boundary values (or its equivalent formulation as a boundary value problem for a degenerately…
In this paper a hierarchical extension of the Minority Game is defined and studied. Numerical simulations show a special type of emergent global behavior between separated parts of the hierarchical structure, connected only through a…
For many standard models of random structure, first-order logic sentences exhibit a convergence phenomenon on random inputs. The most well-known example is for random graphs with constant edge probability, where the probabilities of…
We study the quantitative properties of Lipschitz mappings from Euclidean spaces into metric spaces. We prove that it is always possible to decompose the domain of such a mapping into pieces on which the mapping "behaves like a projection…