English
Related papers

Related papers: On Dynkin Games with Unordered Payoff Processes

200 papers

In this paper, I introduce a novel benchmark in games, super-Nash performance, and a solution concept, optimin, whereby players maximize their minimal payoff under unilateral profitable deviations by other players. Optimin achieves…

Theoretical Economics · Economics 2025-10-23 Mehmet S. Ismail

In two-player zero-sum stochastic games, where two competing players make decisions under uncertainty, a pair of optimal strategies is traditionally described by Nash equilibrium and computed under the assumption that the players have…

Optimization and Control · Mathematics 2019-07-30 Yagiz Savas , Mohamadreza Ahmadi , Takashi Tanaka , Ufuk Topcu

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

Computer Science and Game Theory · Computer Science 2010-04-26 Noah D. Stein , Asuman Ozdaglar , Pablo A. Parrilo

We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…

Logic in Computer Science · Computer Science 2016-03-18 Stéphane Le Roux , Arno Pauly

A new class of multi-player competitive stochastic games in discrete-time with an affine specification of the redistribution of payoffs at exercise is proposed and examined. Our games cover as a very special case the classic two-person…

Probability · Mathematics 2014-05-13 Ivan Guo , Marek Rutkowski

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…

Probability · Mathematics 2019-04-02 Luciano Campi , Davide De Santis

We formulate and study a two-player static duel game as a nonzero-sum discounted stochastic game. Players $P_{1},P_{2}$ are standing in place and, in each turn, one or both may shoot at the other player. If $P_{n}$ shoots at $P_{m}$ ($m\neq…

Discrete Mathematics · Computer Science 2023-04-12 Athanasios Kehagias

A game-theoretic framework for time-inconsistent stopping problems where the time-inconsistency is due to the consideration of a non-linear function of an expected reward is developed. A class of mixed strategy stopping times that allows…

Optimization and Control · Mathematics 2020-01-23 Sören Christensen , Kristoffer Lindensjö

In this paper we establish a new connection between a class of 2-player nonzero-sum games of optimal stopping and certain $2$-player nonzero-sum games of singular control. We show that whenever a Nash equilibrium in the game of stopping is…

Optimization and Control · Mathematics 2017-12-29 Tiziano De Angelis , Giorgio Ferrari

This paper studies the valuation and optimal strategy of convertible bonds as a Dynkin game by using the reflected backward stochastic differential equation method and the variational inequality method. We first reduce such a Dynkin game to…

Mathematical Finance · Quantitative Finance 2015-04-01 Huiwen Yan , Zhou Yang , Fahuai Yi , Gechun Liang

We introduce and analyze a natural game formulated as follows. In this one-person game, the player is given a random permutation $A=(a_1,\dots, a_n)$ of a multiset $M$ of $n$ reals that sum up to $0$, where each of the $n!$ permutation…

Discrete Mathematics · Computer Science 2024-11-21 Adrian Dumitrescu , Arsenii Sagdeev

We consider a nonzero-sum N-player Markov game on an abstract measurable state space with compact metric action spaces. The payoff functions are bounded Carath\'eodory functions and the transitions of the system are assumed to have a…

Optimization and Control · Mathematics 2023-05-09 François Dufour , Tomás Prieto-Rumeau

We consider a zero-sum stochastic game for continuous-time Markov chain with countable state space and unbounded transition and pay-off rates. The additional feature of the game is that the controllers together with taking actions are also…

Optimization and Control · Mathematics 2020-09-01 Chandan Pal , Subhamay Saha

We consider zero-sum stochastic games with perfect information and finitely many states and actions. The payoff is computed by a function which associates to each infinite sequence of states and actions a real number. We prove that if the…

Computer Science and Game Theory · Computer Science 2022-03-29 Hugo Gimbert , Edon Kelmendi

Recent extensions to dynamic games of the well-known fictitious play learning procedure in static games were proved to globally converge to stationary Nash equilibria in two important classes of dynamic games (zero-sum and…

Computer Science and Game Theory · Computer Science 2022-07-08 Lucas Baudin , Rida Laraki

Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a state and executing an action, respectively). The goals of the…

Computer Science and Game Theory · Computer Science 2017-04-05 Thomas Brihaye , Gilles Geeraerts , Axel Haddad , Engel Lefaucheux , Benjamin Monmege

In finite games mixed Nash equilibria always exist, but pure equilibria may fail to exist. To assess the relevance of this nonexistence, we consider games where the payoffs are drawn at random. In particular, we focus on games where a large…

Computer Science and Game Theory · Computer Science 2020-06-18 Ben Amiet , Andrea Collevecchio , Marco Scarsini , Ziwen Zhong

In this paper we investigate Nash equilibrium payoffs for two-player nonzero-sum stochastic differential games whose cost functionals are defined by a system of coupled backward stochastic differential equations. We obtain an existence…

Probability · Mathematics 2014-01-21 Qian Lin

We study the problem of finding equilibrium strategies in multi-agent games with incomplete payoff information, where the payoff matrices are only known to the players up to some bounded uncertainty sets. In such games, an ex-post…

Computer Science and Game Theory · Computer Science 2020-07-14 Wenshuo Guo , Mihaela Curmei , Serena Wang , Benjamin Recht , Michael I. Jordan

This paper deals with N-person nonzero-sum discrete-time Markov games under a probability criterion, in which the transition probabilities and reward functions are allowed to vary with time. Differing from the existing works on the expected…

Probability · Mathematics 2025-05-16 Xin Guo , Xin Wen