English
Related papers

Related papers: Discounted semi-Markov games with incomplete infor…

200 papers

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs…

Optimization and Control · Mathematics 2013-07-15 Pierre Cardaliaguet , Catherine Rainer , Dinah Rosenberg , Nicolas Vieille

We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model…

Logic in Computer Science · Computer Science 2010-06-09 Krishnendu Chatterjee , Rupak Majumdar

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

For zero-sum two-player continuous-time games with integral payoff and incomplete information on one side, one shows that the optimal strategy of the informed player can be computed through an auxiliary optimization problem over some…

Probability · Mathematics 2008-10-02 Pierre Cardaliaguet , Catherine Rainer

We study the value and the optimal strategies for a two-player zero-sum optimal stopping game with incomplete and asymmetric information. In our Bayesian set-up, the drift of the underlying diffusion process is unknown to one player…

Probability · Mathematics 2020-07-15 Tiziano De Angelis , Erik Ekström , Kristoffer Glover

We consider a two-player zero-sum stochastic differential game in which one of the players has a private information on the game. Both players observe each other, so that the non-informed player can try to guess his missing information. Our…

Probability · Mathematics 2011-06-15 Christine Grün

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

Computer Science and Game Theory · Computer Science 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

In this paper we investigate a game of optimal stopping with incomplete information. There are two players of which only one is informed about the precise structure of the game. Observing the informed player the uninformed player is given…

Optimization and Control · Mathematics 2012-07-11 Christine Grün

Semi-Markov model is one of the most general models for stochastic dynamic systems. This paper deals with a two-person zero-sum game for semi-Markov processes. We focus on the expected discounted payoff criterion with state-action-dependent…

Computer Science and Game Theory · Computer Science 2021-03-09 Zhihui Yu , Xianping Guo , Li Xia

We consider a two-player zero-sum game with integral payoff and with incomplete information on one side, where the payoff is chosen among a continuous set of possible payoffs. We prove that the value function of this game is solution of an…

Probability · Mathematics 2012-02-23 Pierre Cardaliaguet , Catherine Rainer

Policy-based methods with function approximation are widely used for solving two-player zero-sum games with large state and/or action spaces. However, it remains elusive how to obtain optimization and statistical guarantees for such…

Machine Learning · Computer Science 2022-03-01 Yulai Zhao , Yuandong Tian , Jason D. Lee , Simon S. Du

We study a two-player, zero-sum, dynamic game with incomplete information where one of the players is more informed than his opponent. We analyze the limit value as the players play more and more frequently. The more informed player…

Optimization and Control · Mathematics 2015-09-14 Fabien Gensbittel

We investigate zero-sum turn-based two-player stochastic games in which the objective of one player is to maximize the amount of rewards obtained during a play, while the other aims at minimizing it. We focus on games in which the minimizer…

Logic in Computer Science · Computer Science 2022-05-20 Pablo F. Castro , Pedro R. D'Argenio , Luciano Putruele , Ramiro Demasi

This paper studies partially observable two-person zero-sum semi-Markov games under a probability criterion, in which the system state may not be completely observed. It focuses on the probability that the accumulated rewards of player 1…

Optimization and Control · Mathematics 2025-08-26 Xin Wen , Li Xia , Zhihui Yu

We study a model of two-player, zero-sum, stopping games with asymmetric information. We assume that the payoff depends on two continuous-time Markov chains (X, Y), where X is only observed by player 1 and Y only by player 2, implying that…

Optimization and Control · Mathematics 2017-12-06 Fabien Gensbittel , Christine Grün

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

A zero-sum two-person Perfect Information Semi-Markov game (PISMG) under limiting ratio average payoff has a value and both the maximiser and the minimiser have optimal pure semi-stationary strategies. We arrive at the result by first…

Computer Science and Game Theory · Computer Science 2023-02-15 S. Sinha , K. G. Bakshi

In this paper, we investigate the existence and characterization of the value for a two-player zero-sum differential game with symmetric incomplete information on a continuum of initial positions and with signal revelation. Before the game…

Optimization and Control · Mathematics 2026-01-01 Xiaochi Wu

The paper proposes a natural measure space of zero-sum perfect information games with upper semicontinuous payoffs. Each game is specified by the game tree, and by the assignment of the active player and of the capacity to each node of the…

Computer Science and Game Theory · Computer Science 2021-04-22 János Flesch , Arkadi Predtetchinski , Ville Suomala

We prove that in a general zero-sum repeated game where the first player is more informed than the second player and controls the evolution of information on the state, the uniform value exists. This result extends previous results on…

Optimization and Control · Mathematics 2013-01-10 Fabien Gensbittel , Miquel Oliu-Barton , Xavier Venel
‹ Prev 1 2 3 10 Next ›