Related papers: Numerical Scheme for Dynkin Games under Model Unce…
Many differential equations with physical backgrounds are described as gradient systems, which are evolution equations driven by the gradient of some functionals, and such problems have energy conservation or dissipation properties. For…
A Dynkin game is considered for stochastic differential equations with random coefficients. We first apply Qiu and Tang's maximum principle for backward stochastic partial differential equations to generalize Krylov estimate for the…
We study a Stackelberg variant of the classical discrete-time Dynkin game, in which Player 1 (the leader) commits to a stopping strategy first and Player 2 (the follower) responds optimally. This leader-follower structure induces an optimal…
Solutions to pursuit-evasion and surveillance-evasion differential games are typically computed and expressed using open-loop representations, with the synthesis of feedback strategies significantly less common. We propose a numerical…
We give a new algorithm for Unique Games which is based on purely {\em spectral} techniques, in contrast to previous work in the area, which relies heavily on semidefinite programming (SDP). Given a highly satisfiable instance of Unique…
Fully-discrete approximations of the Allen-Cahn equation are considered. In particular, we consider schemes of arbitrary order based on a discontinuous Galerkin (in time) approach combined with standard conforming finite elements (in…
In this paper, we propose a numerical methodology for finding the closed-loop Nash equilibrium of stochastic delay differential games through deep learning. These games are prevalent in finance and economics where multi-agent interaction…
We introduce a zero-sum game problem of mean-field type as an extension of the classical zero-sum Dynkin game problem to the case where the payoff processes might depend on the value of the game and its probability law. We establish…
We study a stochastic game where one player tries to find a strategy such that the state process reaches a target of controlled-loss-type, no matter which action is chosen by the other player. We provide, in a general setup, a relaxed…
Synthesizing near-optimal mixed strategies for zero-sum differential games (ZSDGs) has been a longstanding challenge. Existing research mainly focuses on characterizing the theoretical value function, while the practical design of…
This paper provides necessary and sufficient conditions for a pair of randomised stopping times to form a saddle point of a zero-sum Dynkin game with partial and/or asymmetric information across players. The framework is non-Markovian and…
We study a general formulation of the classical two-player Dynkin game in a discrete time Markovian setting. We identify an appropriate class of mixed strategies -- \textit{Markovian randomized stopping times} -- in which players stop at…
We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further…
We tackle the problem of learning equilibria in simulation-based games. In such games, the players' utility functions cannot be described analytically, as they are given through a black-box simulator that can be queried to obtain noisy…
In this paper we introduce and discuss numerical schemes for the approximation of kinetic equations for flocking behavior with phase transitions that incorporate uncertain quantities. This class of schemes here considered make use of a…
In the first part of this paper, uniqueness of strong solution is established for the Vlasov-unsteady Stokes problem in 3D. The second part deals with a semi discrete scheme, which is based on the coupling of discontinuous Galerkin…
In this paper, we investigate optimal stopping problems in a continuous-time framework where only a discrete set of stopping dates is admissible, corresponding to the Bermudan option, within the so-called exploratory formulation. We…
Coordination games have been of interest to game theorists, economists, and ecologists for many years to study such problems as the emergence of local conventions and the evolution of cooperative behavior. Approaches for understanding the…
One of the most classical games for stochastic processes is the zero-sum Dynkin (stopping) game. We present a complete equilibrium solution to a general formulation of this game with an underlying one-dimensional diffusion. A key result is…
We study the problem of stopping a Brownian motion at a given distribution $\nu$ while optimizing a reward function that depends on the (possibly randomized) stopping time and the Brownian motion. Our first result establishes that the set…