相关论文: Dynkin games in a general framework

Feature-based SPL analysis and family-based model checking have seen rapid development. Many model checking problems can be reduced to two-player games on finite graphs. A prominent example is mu-calculus model checking, which is generally…

The famous theorem of R.Aumann and M.Maschler states that the sequence of values of an N-stage zero-sum game G_N with incomplete information on one side converges as N tends to infinity, and the error term is bounded by a constant divided…

We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic results (such as the existence of a Nash equilibrium) no longer…

For any integer $d \geq 1$, we verify the Jacobian Conjecture for a $d$-linear map in two variables. We prove that almost all the coefficients of the formal inverse are in the ideal specified by the Jacobian condition. We find expressions…

Mean field games formalize dynamic games with a continuum of players and explicit interaction where the players can have heterogeneous states. As they additionally yield approximate equilibria of corresponding $N$-player games, they are of…

In this paper we prove a new abstract stability result for perturbed saddle-point problems based on a norm fitting technique. We derive the stability condition according to Babuska's theory from a small inf-sup condition, similar to the…

We consider deterministic mean field games in which the agents control their acceleration and are constrained to remain in a domain of R n. We study relaxed equilibria in the Lagrangian setting; they are described by a probability measure…

For a family of multidimensional gambler models we provide formulas for the winning probabilities (in terms of parameters of the system) and for the distribution of game duration (in terms of eigenvalues of underlying one-dimensional…

We introduce an efficient numerical scheme for continuous time Dynkin games under model uncertainty. We use the Skorokhod embedding in order to construct recombining tree approximations. This technique allows us to determine convergence…

We explore a mechanism of decision-making in Mean Field Games with myopic players. At each instant, agents set a strategy which optimizes their expected future cost by assuming their environment as immutable. As the system evolves, the…

We use a simple N-player stochastic game with idiosyncratic and common noises to introduce the concept of Master Equation originally proposed by Lions in his lectures at the Coll\`ege de France. Controlling the limit N tends to the infinity…

This paper considers mean field games in a multi-agent Markov decision process (MDP) framework. Each player has a continuum state and binary action, and benefits from the improvement of the condition of the overall population. Based on an…

This paper introduces two fundamentally new concepts to game theory: multilateral Nash equilibria and families of games. Starting with non-cooperative games, we show how these notions together seamlessly integrate into and naturally extend…

This paper contains a reformulation of any $n$-player finite, static game into a framework of distributed, dynamical system based on agents' payoff-based deviations. The reformulation generalizes the method employed in the second part of…

Min-max optimization problems, also known as saddle point problems, have attracted significant attention due to their applications in various fields, such as fair beamforming, generative adversarial networks (GANs), and adversarial…

This paper revisits the well-studied \emph{optimal stopping} problem but within the \emph{large-population} framework. In particular, two classes of optimal stopping problems are formulated by taking into account the \emph{relative…

In this paper, we introduce a specific kind of doubly reflected Backward Stochastic Differential Equations (in short DRBSDEs), defined on probability spaces equipped with general filtration that is essentially non quasi-left continuous,…

We consider the variational approach to prove the existence of solutions of second order stationary Mean Field Games on a bounded domain $\Omega\subseteq \mathbb{R}^{d}$, with Neumann boundary conditions, and with and without density…

We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…

We introduce a new type of game on natural numbers of variable countable length, which can be regarded as a diagonalization of all games of fixed countable length on natural numbers. Building on previous work by Trang and Woodin, we show…