English
Related papers

Related papers: Zero-sum continuous-time Markov games with one-sid…

200 papers

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to…

Optimization and Control · Mathematics 2015-08-26 Zhou Zhou

We extend the construction of equilibria for linear-quadratic and mean-variance portfolio problems available in the literature to a large class of mean-field time-inconsistent stochastic control problems in continuous time. Our approach…

Optimization and Control · Mathematics 2021-10-01 Jiang Yu Nguwi , Nicolas Privault

Markov games with coupling constraints model constrained dynamical decision-making involving self-interested agents, where the feasibility of an individual agent's strategy depends on the joint strategies of the others. Such games arise in…

Computer Science and Game Theory · Computer Science 2026-05-27 Tingting Ni , Anna Maddux , Maryam Kamgarpour

We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.

Probability · Mathematics 2015-07-28 Erhan Bayraktar , Zhou Zhou

The theory of mean field games is a tool to understand noncooperative dynamic stochastic games with a large number of players. Much of the theory has evolved under conditions ensuring uniqueness of the mean field game Nash equilibrium.…

Optimization and Control · Mathematics 2019-03-19 Bruce Hajek , Michael Livesay

In a zero-sum stochastic game with signals, at each stage, two adversary players take decisions and receive a stage payoff determined by these decisions and a variable called state. The state follows a Markov chain, that is controlled by…

Optimization and Control · Mathematics 2021-12-02 Bruno Ziliotto

This paper investigates properties of Blackwell $\epsilon$-optimal strategies in zero-sum stochastic games when the adversary is restricted to stationary strategies, motivated by applications to robust Markov decision processes. For a class…

Computer Science and Game Theory · Computer Science 2025-03-20 Julien Grand-Clément , Nicolas Vieille

We study dynamic finite-player and mean-field stochastic games within the framework of Markov perfect equilibria (MPE). Our focus is on discrete time and space structures without monotonicity. Unlike their continuous-time analogues,…

Optimization and Control · Mathematics 2025-09-29 Felix Höfer , H. Mete Soner , Atilla Yılmaz

Optimization under uncertainty is a fundamental problem in learning and decision-making, particularly in multi-agent systems. Previously, Feldman, Kalai, and Tennenholtz [2010] demonstrated the ability to efficiently compete in repeated…

Computer Science and Game Theory · Computer Science 2026-01-29 Daniel Ablin , Alon Cohen

In this paper we study the optimization problem of an economic agent who chooses a job and the time of retirement as well as consumption and portfolio of assets. The agent is constrained in the ability to borrow against future income. We…

Optimization and Control · Mathematics 2021-07-28 Junkee Jeon , Hyeng Keun Koo

We study the optimal use of information in Markov games with incomplete information on one side and two states. We provide a finite-stage algorithm for calculating the limit value as the gap between stages goes to 0, and an optimal strategy…

Optimization and Control · Mathematics 2019-03-19 Galit Ashkenazi-Golan , Catherine Rainer , Eilon Solan

In this paper we consider two-person zero-sum risk-sensitive stochastic dynamic games with Borel state and action spaces and bounded reward. The term risk-sensitive refers to the fact that instead of the usual risk neutral optimization…

Optimization and Control · Mathematics 2021-07-21 Nicole Bäuerle , Ulrich Rieder

We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…

Computer Science and Game Theory · Computer Science 2024-06-05 Mukesh Ghimire , Lei Zhang , Zhe Xu , Yi Ren

In this paper we study a zero-sum switching game and its verification theorems expressed in terms of either a system of Reflected Backward Stochastic Differential Equations (RBSDEs in short) with bilateral interconnected obstacles or a…

Probability · Mathematics 2020-06-30 Said Hamadène , Tingshu Mu

A multi-player competitive Dynkin stopping game is constructed. Each player can either exit the game for a fixed payoff, determined a priori, or stay and receive an adjusted payoff depending on the decision of other players. The single…

Computer Science and Game Theory · Computer Science 2012-11-20 Ivan Guo

We investigate a two-player zero-sum stochastic differential game problem with the state process being constrained in a connected bounded closed domain, and the cost functional described by the solution of a generalized backward stochastic…

Probability · Mathematics 2017-05-12 Lishun Xiao , Dejian Tian

Many non-trivial sequential decision-making problems are efficiently solved by relying on Bellman's optimality principle, i.e., exploiting the fact that sub-problems are nested recursively within the original problem. Here we show how it…

Artificial Intelligence · Computer Science 2022-11-16 Olivier Buffet , Jilles Dibangoye , Aurélien Delage , Abdallah Saffidine , Vincent Thomas

This paper is concerned with the controller-and-stopper stochastic differential game under a regime switching model in an infinite horizon. The state of the system consists of a number of diffusions \emph{coupled} by a continuous-time…

Optimization and Control · Mathematics 2021-11-02 Siyu Lv

We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-time Markov games. Furthermore, we show that optimal control…

Formal Languages and Automata Theory · Computer Science 2010-06-07 Markus Rabe , Sven Schewe

We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an…

Probability · Mathematics 2009-11-23 Erhan Bayraktar , Ioannis Karatzas , Song Yao