相关论文: The Lipschitz Constant of Perturbed Anonymous Game…

The Lipschitz constant of a finite normal-form game is the maximal change in some player's payoff when a single opponent changes his strategy. We prove that games with small Lipschitz constant admit pure {\epsilon}-equilibria, and pinpoint…

We investigate the complexity of computing approximate Nash equilibria in anonymous games. Our main algorithmic result is the following: For any $n$-player anonymous game with a bounded number of strategies and any constant $\delta>0$, an…

Lipschitz games, in which there is a limit $\lambda$ (the Lipschitz value of the game) on how much a player's payoffs may change when some other player deviates, were introduced about 10 years ago by Azrieli and Shmaya. They showed via the…

For the singularly perturbed system \[\Delta u_{i,\beta}=\beta u_{i,\beta}\sum_{j\neq i}u_{j,\beta}^2, \quad 1\leq i\leq N,\] we prove that flat interfaces are uniformly Lipschitz. As a byproduct of the proof we also obtain the optimal…

We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentiate between other players. Our results pertain to such games…

We consider a stochastic game of control and stopping specified in terms of a process $X_t=-\theta \Lambda_t+W_t$, representing the holdings of Player 1, where $W$ is a Brownian motion, $\theta$ is a Bernoulli random variable indicating…

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…

Kalu\v{z}a, Kopeck\'a and the author have shown that the best Lipschitz constant for mappings taking a given $n^{d}$-element set in the integer lattice $\mathbb{Z}^{d}$, with $n\in \mathbb{N}$, surjectively to the regular $n$ times $n$ grid…

We study local regularity properties of value functions of time-dependent tug-of-war games. For games with constant probabilities we get local Lipschitz continuity. For more general games with probabilities depending on space and time we…

For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…

We prove an asymptotic Lipschitz estimate for value functions of tug-of-war games with varying probabilities defined in $\Omega\subset \mathbb R^n$. The method of the proof is based on a game-theoretic idea to estimate the value of a…

We consider a random walk of $n$ steps starting at $x_0=0$ with a double exponential (Laplace) jump distribution. We compute exactly the distribution $p_{k,n}(\Delta)$ of the gap $d_{k,n}$ between the $k^{\rm th}$ and $(k+1)^{\rm th}$…

In a bounded domain $\Omega \subset \mathbb{R}^d$ over time interval $(0,T)$, we consider mean field game equations whose principal coefficients depend on the time and state variables with a general Hamiltonian. We attach the non-zero Robin…

We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata…

We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the probability that the endpoint is at x, P_{lambda}(x;N),…

In decision-dependent games, multiple players optimize their decisions under a data distribution that shifts with their joint actions, creating complex dynamics in applications like market pricing. A practical consequence of these dynamics…

We prove that for any constant $K\geq1$, the value functions for time homogeneous stochastic differential games in the whole space can be approximated up to a constant over $K$ by value functions whose second-order derivatives are bounded…

In this paper, we study games with continuous action spaces and non-linear payoff functions. Our key insight is that Lipschitz continuity of the payoff function allows us to provide algorithms for finding approximate equilibria in these…

A celebrated result in probability theory is that a simple symmetric random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ is recurrent for $d=1,2$ and transient for $d\geq 3$. In this note, we derive a closed-form expression, in terms…

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…