We consider an abstract setting of the differential r&d game, where participating firms are allowed for strategic behavior. We assume the information asymmetry across those firms and the government, which seeks to support newer technologies in a socially optimal manner. We develop a general...

Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there is in practice a finite number of possible tap positions, identical...

Nonzero-sum stochastic differential games with impulse controls offer a realistic and far-reaching modelling framework for applications within finance, energy markets, and other areas, but the difficulty in solving such problems has hindered their proliferation. Semi-analytical approaches make...

This work presents a novel policy iteration algorithm to tackle nonzero-sum stochastic impulse games arising naturally in many applications. Despite the obvious impact of solving such problems, there are no suitable numerical methods available, to the best of our knowledge. Our method relies on...

In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is based on...

We study a multi-player stochastic differential game, where agents interact through their joint price impact on an asset that they trade to exploit a common trading signal. In this context, we prove that a closed-loop Nash equilibrium exists if the price impact parameter is small enough....

This paper studies strategic interaction in networks. We focus on games of strategic substitutes and strategic complements, and departing from previous literature, we do not assume particular functional forms on players' payoffs. By exploiting variational methods, we show that the uniqueness,...

We consider any network environment in which the "best shot game" is played. This is the case where the possible actions are only two for every node (0 and 1), and the best response for a node is 1 if and only if all her neighbors play 0. A natural application of the model is one in which the...

This paper studies three different approximation concepts in the context of n-person concave games. Formally, we establish the precise relationship between the notions of ε-Nash Equilibrium, $\hatε-approximate solution, and δ-near Nash equilibrium. We apply our results to the class of...