English
Related papers

Related papers: Dynkin games with incomplete and asymmetric inform…

200 papers

A zero-sum two person Perfect Information Stochastic game (PISG) under limiting average payoff has a value and both the maximiser and the minimiser have optimal pure stationary strategies. Firstly we form the matrix of undiscounted payoffs…

Optimization and Control · Mathematics 2023-02-15 K. G. Bakshi , S. Sinha

We investigate a two-player zero-sum stochastic differential game in which one of the players has more information on the game than his opponent. We show how to construct numerical schemes for the value function of this game, which is given…

Computer Science and Game Theory · Computer Science 2011-11-18 Christine Grün

Many decision problems in economics, information technology, and industry can be transformed to an optimal stopping of adapted random vectors with some utility function over the set of Markov times with respect to filtration build by the…

Optimization and Control · Mathematics 2020-11-04 Krzysztof Szajowski

In this second part of our two-part paper, we invoke the stochastic maximum principle, conditional Hamiltonian and the coupled backward-forward stochastic differential equations of the first part [1] to derive team optimal decentralized…

Optimization and Control · Mathematics 2013-02-15 Charalambos D. Charalambous , Nasir U. Ahmed

Two-player zero-sum "graph games" are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite "play", which determines the winner or payoff of the game.…

Computer Science and Game Theory · Computer Science 2022-11-28 Guy Avni , Ismael Jecker , Djordje Zikelic

We consider a stochastic differential equation that is controlled by means of an additive finite-variation process. A singular stochastic controller, who is a minimizer, determines this finite-variation process, while a discretionary…

Probability · Mathematics 2015-01-20 Daniel Hernandez-Hernandez , Robert S. Simon , Mihail Zervos

This paper investigates mixed strategies in dynamic games with perfect information. We present an example to show that a player may obtain higher payoff by playing mixed strategy. By contrast, the main result of the paper shows that every…

Optimization and Control · Mathematics 2020-01-01 Enxian Chen , Wei He , Yeneng Sun , Hanping Xu

We consider a stochastic game with partial, asymmetric and non-classical information, where the agents are trying to acquire as many available opportunities/locks as possible. Agents have access only to local information, the information…

Optimization and Control · Mathematics 2020-09-07 Vartika Singh , Veeraruna Kavitha

We consider discrete time partially observable zero-sum stochastic game with average payoff criterion. We study the game using an equivalent completely observable game. We show that the game has a value and also we come up with a pair of…

Optimization and Control · Mathematics 2014-09-16 Subhamay Saha

We study pricing and superhedging strategies for game options in an imperfect market with default. We extend the results obtained by Kifer in \cite{Kifer} in the case of a perfect market model to the case of an imperfect market with…

Mathematical Finance · Quantitative Finance 2017-07-04 Roxana Dumitrescu , Marie-Claire Quenez , Agnès Sulem

We study two-player constant-sum Bayesian games with type-independent payoffs. Under a "completeness" statistical condition, any "identifiable'" equilibrium is an ex-post equilibrium. We apply this result to a Downsian election in which…

Theoretical Economics · Economics 2025-12-22 Navin Kartik , Francesco Squintani , Katrin Tinn

In this article, we focus on search algorithms for two-player perfect information games, whose objective is to determine the best possible strategy, and ideally a winning strategy. Unfortunately, some search algorithms for games in the…

Artificial Intelligence · Computer Science 2026-03-26 Quentin Cohen-Solal

The goal of agents in multi-agent environments is to maximize total reward against the opposing agents that are encountered. Following a game-theoretic solution concept, such as Nash equilibrium, may obtain a strong performance in some…

Computer Science and Game Theory · Computer Science 2026-01-05 Sam Ganzfried

We consider optimal stopping problems, in which a sequence of independent random variables is drawn from a known continuous density. The objective of such problems is to find a procedure which maximizes the expected reward; this is often…

Probability · Mathematics 2020-12-07 Hugh Entwistle , Christopher Lustri , Georgy Sofronov

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 is concerned with a two-person zero-sum indefinite stochastic linear-quadratic Stackelberg differential game with asymmetric informational uncertainties, where both the leader and follower face different and unknown disturbances.…

Optimization and Control · Mathematics 2024-07-09 Na Xiang , Jingtao Shi

We study a stopping game of preemption type between two players who both act under uncertain competition. In this framework we introduce, and study the effect of, (i) asymmetry of payoffs, allowing e.g. for different investment costs, and…

Probability · Mathematics 2024-11-08 Erik Ekström , Yuqiong Wang

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 consider extensive games with perfect information with well-founded game trees and study the problems of existence and of characterization of the sets of subgame perfect equilibria in these games. We also provide such characterizations…

Computer Science and Game Theory · Computer Science 2021-06-23 Krzysztof R. Apt , Sunil Simon

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…

Optimization and Control · Mathematics 2018-02-05 Charafeddine Mouzouni