English
Related papers

Related papers: A Zero-Sum Stochastic Game with Compact Action Set…

200 papers

In this paper, we consider a large class of constrained non-cooperative stochastic Markov games with countable state spaces and discounted cost criteria. In one-player case, i.e., constrained discounted Markov decision models, it is…

Optimization and Control · Mathematics 2021-12-16 Anna Jaśkiewicz , Andrzej S. Nowak

Zero-sum stochastic games provide a rich model for competitive decision making. However, under general forms of state uncertainty as considered in the Partially Observable Stochastic Game (POSG), such decision making problems are still not…

Artificial Intelligence · Computer Science 2016-06-23 Auke J. Wiggers , Frans A. Oliehoek , Diederik M. Roijers

We study a zero-sum stochastic differential switching game in infinite horizon. We prove the existence of the value of the game and characterize it as the unique viscosity solution of the associated system of quasi-variational inequalities…

Optimization and Control · Mathematics 2018-05-04 Brahim El Asri , Sehail Mazid

Mean-payoff zero-sum stochastic games can be studied by means of a nonlinear spectral problem. When the state space is finite, the latter consists in finding an eigenpair $(u,\lambda)$ solution of $T(u)=\lambda e + u$, where $T:\mathbb{R}^n…

Optimization and Control · Mathematics 2019-12-30 Marianne Akian , Stéphane Gaubert , Antoine Hochart

The problem of computing the smallest fixed point of an order-preserving map arises in the study of zero-sum positive stochastic games. It also arises in static analysis of programs by abstract interpretation. In this context, the discount…

Optimization and Control · Mathematics 2014-02-04 Assalé Adjé , Stéphane Gaubert , Eric Goubault

Two-player quantitative zero-sum games provide a natural framework to synthesize controllers with performance guarantees for reactive systems within an uncontrollable environment. Classical settings include mean-payoff games, where the…

Logic in Computer Science · Computer Science 2016-07-11 Patricia Bouyer , Nicolas Markey , Mickael Randour , Kim G. Larsen , Simon Laursen

This paper considers the discounted criterion of nonzero-sum decentralized stochastic games with prospect players. The state and action spaces are finite. The state transition probability is nonstationary. Each player independently controls…

Optimization and Control · Mathematics 2024-05-16 Yiting Wu , Junyu Zhang

Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…

Information Theory · Computer Science 2009-11-05 Paul Cuff

We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…

Combinatorics · Mathematics 2020-02-14 Gal Cohensius , Urban Larsson , Reshef Meir , David Wahlstedt

We investigate a two-player zero-sum stochastic differential game in which the players have an asymmetric information on the random payoff. We prove that the game has a value and characterize this value in terms of dual solutions of some…

Optimization and Control · Mathematics 2007-05-23 Pierre Cardaliaguet , Catherine Rainer

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 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

Many security and other real-world situations are dynamic in nature and can be modelled as strictly competitive (or zero-sum) dynamic games. In these domains, agents perform actions to affect the environment and receive observations --…

Computer Science and Game Theory · Computer Science 2020-10-23 Karel Horák , Branislav Bošanský , Vojtěch Kovařík , Christopher Kiekintveld

We give an alternative proof that every two-person non-zero-sum absorbing positive recursive stochastic game with finitely many states has approximate equilibria, a result proven by Nicolas Vieille. Our proof uses a state specific discount…

Probability · Mathematics 2011-10-12 Robert Samuel Simon

We study new classes of games, called zero-sum equivalent games and zero-sum equivalent potential games, and prove decomposition theorems involving these classes of games. We say that two games are "strategically equivalent" if, for every…

Computer Science and Game Theory · Computer Science 2020-05-20 Sung-Ha Hwang , Luc Rey-Bellet

In this paper we consider an infinite horizon zero-sum differential game where the dynamics of each player and the running cost are also depending on the evolution of some discrete (switching) variables. In particular, such switching…

Optimization and Control · Mathematics 2020-03-05 Fabio Bagagiolo , Rosario Maggistro , Marta Zoppello

Simple stochastic games are turn-based 2.5-player zero-sum graph games with a reachability objective. The problem is to compute the winning probability as well as the optimal strategies of both players. In this paper, we compare the three…

Computer Science and Game Theory · Computer Science 2020-09-24 Jan Křetínský , Emanuel Ramneantu , Alexander Slivinskiy , Maximilian Weininger

We consider a stochastic differential game in the context of forward-backward stochastic differential equations, where one player implements an impulse control while the opponent controls the system continuously. Utilizing the notion of…

Optimization and Control · Mathematics 2021-12-20 Magnus Perninge

We examine perfect information stochastic mean-payoff games - a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted…

Computer Science and Game Theory · Computer Science 2010-06-09 Hugo Gimbert , Wiesław Zielonka

We study a zero-sum game where the evolution of a spectrally one-sided Levy process is modified by a singular controller and is terminated by the stopper. The singular controller minimizes the expected values of running, controlling and…

Optimization and Control · Mathematics 2014-08-08 Daniel Hernandez-Hernandez , Kazutoshi Yamazaki