English
Related papers

Related papers: A Dynkin Game with Independent Processes and Incom…

200 papers

We formulate a mean field game where each player stops a privately observed Brownian motion with absorption. Players are ranked according to their level of stopping and rewarded as a function of their relative rank. There is a unique mean…

Optimization and Control · Mathematics 2021-03-09 Marcel Nutz , Yuchong Zhang

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

We study a two-player zero-sum game in continuous time, where the payoff-a running cost-depends on a Brownian motion. This Brownian motion is observed in real time by one of the players. The other one observes only the actions of his…

Optimization and Control · Mathematics 2017-03-22 Fabien Gensbittel , Catherine Rainer

This paper analyses two-player nonzero-sum games of optimal stopping on a class of linear regular diffusions with not non-singular boundary behaviour (in the sense of It\^o and McKean (1974), p.\ 108). We provide sufficient conditions under…

Probability · Mathematics 2017-08-03 Tiziano De Angelis , Giorgio Ferrari , John Moriarty

Secure equilibrium is a refinement of Nash equilibrium, which provides some security to the players against deviations when a player changes his strategy to another best response strategy. The concept of secure equilibrium is specifically…

Computer Science and Game Theory · Computer Science 2014-05-08 Julie De Pril , János Flesch , Jeroen Kuipers , Gijs Schoenmakers , Koos Vrieze

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

We introduce a novel class of Nash equilibrium seeking dynamics for non-cooperative games with a finite number of players, where the convergence to the Nash equilibrium is bounded by a KL function with a settling time that can be upper…

Optimization and Control · Mathematics 2020-12-25 Jorge I. Poveda , Miroslav Krstic , Tamer Basar

In optimal stopping problems, a Markov structure guarantees Markovian optimal stopping times (first exit times). Surprisingly, there is no analogous result for Markovian stopping games once randomization is required. This paper addresses…

Probability · Mathematics 2024-08-02 Sören Christensen , Boy Schultz

We introduce a model of sender-receiver stopping games, where the state of the world follows an iid--process throughout the game. At each period, the sender observes the current state, and sends a message to the receiver, suggesting either…

Computer Science and Game Theory · Computer Science 2020-04-07 Aditya Aradhye , János Flesch , Mathias Staudigl , Dries Vermeulen

We prove that every two-player nonzero-sum stopping game in discrete time admits an \epsilon-equilibrium in randomized strategies for every \epsilon >0. We use a stochastic variation of Ramsey's theorem, which enables us to reduce the…

Probability · Mathematics 2007-05-23 Eran Shmaya , Eilon Solan

We consider a class of two-player dynamic stochastic nonzero-sum games where the state transition and observation equations are linear, and the primitive random variables are Gaussian. Each controller acquires possibly different dynamic…

Systems and Control · Computer Science 2014-01-21 Abhishek Gupta , Ashutosh Nayyar , Cedric Langbort , Tamer Basar

Consider a 2-player normal-form game repeated over time. We introduce an adaptive learning procedure, where the players only observe their own realized payoff at each stage. We assume that agents do not know their own payoff function, and…

Computer Science and Game Theory · Computer Science 2013-06-13 Mario Bravo , Mathieu Faure

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

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 consider Dynkin games for Markov processes associated with semi-Dirichlet forms. Dynkin games are the optimal stopping games introduced as the models of zero-sum games by two players. We prove that the solution to the certain variational…

Probability · Mathematics 2023-04-26 Takumu Ooi , Toshihiro Uemura

This paper studies a duopoly investment model with uncertainty. There are two alternative irreversible investments. The first firm to invest gets a monopoly benefit for a specified period of time. The second firm to invest gets information…

Optimization and Control · Mathematics 2019-03-01 Kristina Rognlien Dahl , Espen Stokkereit

We study best-response type learning dynamics for zero-sum polymatrix games under two information settings. The two settings are distinguished by the type of information that each player has about the game and their opponents' strategy. The…

Optimization and Control · Mathematics 2025-08-13 Fathima Zarin Faizal , Asuman Ozdaglar , Martin J. Wainwright

We study a class of deterministic finite-horizon two-player nonzero-sum differential games where players are endowed with different kinds of controls. We assume that Player 1 uses piecewise-continuous controls, while Player 2 uses impulse…

Optimization and Control · Mathematics 2025-10-21 Utsav Sadana , Puduru Viswanadha Reddy , Georges Zaccour

We consider infinite-state turn-based stochastic games of two players, Box and Diamond, who aim at maximizing and minimizing the expected total reward accumulated along a run, respectively. Since the total accumulated reward is unbounded,…

Computer Science and Game Theory · Computer Science 2012-08-09 Tomáš Brázdil , Antonín Kučera , Petr Novotný

A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an $\epsilon$-Nash equilibrium if no player can gain more than $\epsilon$ by…

Computer Science and Game Theory · Computer Science 2026-01-27 Ali Asadi , Léonard Brice , Krishnendu Chatterjee , K. S. Thejaswini