相关论文: Stopping games in continuous time

In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty…

We study two-player zero-sum stochastic games, and propose a form of independent learning dynamics called Doubly Smoothed Best-Response dynamics, which integrates a discrete and doubly smoothed variant of the best-response dynamics into…

This work considers two-player zero-sum semi-Markov games with incomplete information on one side and perfect observation. At the beginning, the system selects a game type according to a given probability distribution and informs to Player…

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where 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…

We consider optimal stopping problems with finite-time horizon and state-dependent discounting. The underlying process is a one-dimensional linear diffusion and the gain function is time-homogeneous and difference of two convex functions.…

We present two zero-sum games modeling situations where one player attacks (or hides in) a finite dimensional nonempty compact set, and the other tries to prevent the attack (or find him). The first game, called patrolling game, corresponds…

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)…

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…

The paper is concerned with two-person dynamic zero-sum games. We investigate the limit of value functions of finite horizon games with long run average cost as the time horizon tends to infinity, and the limit of value functions of…

In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first…

We consider the behaviour of $\lambda$-discounted zero-sum games as the discount factor $\lambda$ approaches 0 (that is, the players are more and more patient), in the context of games with stage duration. In stochastic games with stage…

We study the asymptotic value of a frequency-dependent zero-sum game with separable payoff following a differential approach. The stage payoffs in such games depend on the current actions and on a linear function of the frequency of actions…

Under non-exponential discounting, we develop a dynamic theory for stopping problems in continuous time. Our framework covers discount functions that induce decreasing impatience. Due to the inherent time inconsistency, we look for…

Pursuit-evasion scenarios appear widely in robotics, security domains, and many other real-world situations. We focus on two-player pursuit-evasion games with concurrent moves, infinite horizon, and discounted rewards. We assume that the…

We study a two-player nonzero-sum stochastic differential game where one player controls the state variable via additive impulses while the other player can stop the game at any time. The main goal of this work is characterize Nash…

In this paper we study infinite horizon nonzero-sum stochastic games for controlled discrete-time Markov chains on a Polish state space with risk-sensitive ergodic cost criterion. Under suitable assumptions we show that the associated…

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…

An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to…

This paper studies two-player zero-sum stochastic Bayesian games where each player has its own dynamic state that is unknown to the other player. Using typical techniques, we provide the recursive formulas and sufficient statistics in both…