Related papers: Mind the gap: A real-valued distance on combinator…
We propose a numerical method for stationary Mean Field Games defined on a network. In this framework a correct approximation of the transition conditions at the vertices plays a crucial role. We prove existence, uniqueness and convergence…
We study the localization game on dense random graphs. In this game, a {\em cop} $x$ tries to locate a {\em robber} $y$ by asking for the graph distance of $y$ from every vertex in a sequence of sets $W_1,W_2,\ldots,W_\ell$. We prove high…
The purpose of this paper is to study more general real-valued functions of two variables than just metrics on a set X. We concentrate mainly on the classes of distances and almost distances. We also introduce the notion of a bridge on the…
Let $ (X,d) $ be a metric space. We study a metric $ d_0 $ on $ X $ naturally derived from $ d $. If $ (X,d) $ is complete and locally compact, or if it is complete and $ (d_0)_0=d_0 $, then $ d_0 $ coincides with the length metric induced…
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times…
The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…
We study the links between the values of stochastic games with varying stage duration $h$, the corresponding Shapley operators $\bf{T}$ and ${\bf{T}}\_h$and the solution of $\dot f\_t = ({\bf{T}} - Id )f\_t$. Considering general non…
We introduce and analyze the Walker-Breaker game, a variant of Maker-Breaker games where Maker is constrained to choose edges of a walk or path in a given graph G, with the goal of visiting as many vertices of the underlying graph as…
We define a random step size tug-of-war game, and show that the gradient of a value function exists almost everywhere. We also prove that the gradients of value functions are uniformly bounded and converge weakly to the gradient of the…
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his…
This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point lattices. The first part is dedicated to formalization of definitions and properties (distance,…
We study a new class of distances between Radon measures similar to those studied in a recent paper of Dolbeault-Nazaret-Savar\'e [DNS]. These distances (more correctly pseudo-distances because can assume the value $+\infty$) are defined…
We investigate the resolution of second-order, potential, and monotone mean field games with the generalized conditional gradient algorithm, an extension of the Frank-Wolfe algorithm. We show that the method is equivalent to the fictitious…
Game theory is the study of tractable games which may be used to model more complex systems. Board games, video games and sports, however, are intractable by design, so "ludological" theories about these games as complex phenomena should be…
For realcompact spaces X and Y we give a complete description of the linear biseparating maps between spaces of vector-valued continuous functions on X and Y, where special attention is paid to spaces of vector-valued bounded continuous…
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…
We establish the existence and uniqueness of distributed equilibria to possibly nonsymmetric $N$ player differential games with interactions through controls under displacement semimonotonicity assumptions. Surprisingly, the nonseparable…
We introduce a new allocation rule, the uniform-dividend value (UD-value), for cooperative games whose characteristic function is incomplete. The UD-value assigns payoffs by distributing the total surplus of each family of indistinguishable…
Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…
In topological data science, categories with a flow have become ubiquitous, including as special cases examples like persistence modules and sheaves. With the flow comes an interleaving distance, which has proven useful for applications. We…