Related papers: A game interpretation for the weighted $p$-Laplace…
We propose the first loss function for approximate Nash equilibria of normal-form games that is amenable to unbiased Monte Carlo estimation. This construction allows us to deploy standard non-convex stochastic optimization techniques for…
We introduce a game-theoretical framework for the doubly nonlinear parabolic equation \[ |\partial_t u|^{p-2} \partial_t u - \Delta_p u = 0. \] where $\Delta_p u = \nabla \cdot ( |\nabla u |^{p-2} \nabla u)$ with $p>2$ is the standard…
A robust game is a distribution-free model to handle ambiguity generated by a bounded set of possible realizations of the values of players' payoff functions. The players are worst-case optimizers and a solution, called robust-optimization…
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main…
In this paper we prove an approximation result for the viscosity solution of a system of semi-linear partial differential equations with continuous coefficients and nonlinear Neumann boundary condition. The approximation we use is based on…
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a)…
We give an analytic proof of the solution of Dirichlet Problem for continous functions satisfying a nonlinear mean value problem related to the p-laplace operator and certain stochastic games.
Value methods for solving stochastic games with partial observability model the uncertainty about states of the game as a probability distribution over possible states. The dimension of this belief space is the number of states. For many…
We introduce a simple class of mean field games with absorbing boundary over a finite time horizon. In the corresponding $N$-player games, the evolution of players' states is described by a system of weakly interacting It\^o equations with…
Many problems in compositional synthesis and verification of multi-agent systems -- such as rational verification and assume-guarantee verification in probabilistic systems -- reduce to reasoning about two-player multi-objective stochastic…
This paper studies a two-player nonzero-sum stochastic differential game governed by a controlled convection-diffusion stochastic partial differential equation (SPDE) with spatially heterogeneous coefficients. The diffusion and transport…
We consider an n-player symmetric stochastic game with weak interaction between the players. Time is continuous and the horizon and the number of states are finite. We show that the value function of each of the players can be approximated…
This paper analyzes a simple game with $n$ players. We fix a mean, $\mu$, in the interval $[0, 1]$ and let each player choose any random variable distributed on that interval with the given mean. The winner of the zero-sum game is the…
We study the problem of finding the Nash equilibrium in a two-player zero-sum Markov game. Due to its formulation as a minimax optimization program, a natural approach to solve the problem is to perform gradient descent/ascent with respect…
This paper introduces a measure of uncertainty in the determination of the Shapley value, illustrates it with examples, and studies some of its properties. The introduced measure of uncertainty quantifies random variations in a player's…
We propose an implementable, neural network-based structure preserving probabilistic numerical approximation for a generalized obstacle problem describing the value of a zero-sum differential game of optimal stopping with asymmetric…
Ergodicity for local and nonlocal stochastic singular $p$-Laplace equations is proven, without restriction on the spatial dimension and for all $p\in[1,2)$. This generalizes previous results from [Gess, T\"{o}lle; J. Math. Pures Appl.,…
The influential work of Bravo et al. 2018 shows that derivative free play in strongly monotone games has complexity $O(d^2/\varepsilon^3)$, where $\varepsilon$ is the target accuracy on the expected squared distance to the solution. This…
We study the sample complexity of identifying an approximate equilibrium for two-player zero-sum $n\times 2$ matrix games. That is, in a sequence of repeated game plays, how many rounds must the two players play before reaching an…
We examine $L^p$-viscosity solutions to fully nonlinear elliptic equations with bounded-measurable ingredients. By considering $p_0<p<d$, we focus on gradient-regularity estimates stemming from nonlinear potentials. We find conditions for…