English
Related papers

Related papers: Zero-Sum Semi-Markov Games with State-Action-Depen…

200 papers

In this paper, we settle the sampling complexity of solving discounted two-player turn-based zero-sum stochastic games up to polylogarithmic factors. Given a stochastic game with discount factor $\gamma\in(0,1)$ we provide an algorithm that…

Machine Learning · Computer Science 2019-08-30 Aaron Sidford , Mengdi Wang , Lin F. Yang , Yinyu Ye

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

Shapley (1953) introduced two-player zero-sum discounted stochastic games, henceforth stochastic games, a model where a state variable follows a two-controlled Markov chain, the players receive rewards at each stage which add up to $0$, and…

Optimization and Control · Mathematics 2020-03-06 Bruno Jaffuel , Miquel Oliu-Barton

In this paper, we consider the problem of optimization and learning for constrained and multi-objective Markov decision processes, for both discounted rewards and expected average rewards. We formulate the problems as zero-sum games where…

Optimization and Control · Mathematics 2021-03-05 Ather Gattami , Qinbo Bai , Vaneet Agarwal

Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…

Optimization and Control · Mathematics 2019-05-17 Jérôme Renault

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

This paper introduces state abstraction for two-player zero-sum Markov games (TZMGs), where the payoffs for the two players are determined by the state representing the environment and their respective actions, with state transitions…

Computer Science and Game Theory · Computer Science 2024-12-23 Hiroki Ishibashi , Kenshi Abe , Atsushi Iwasaki

We study nonzero-sum stochastic games for continuous time Markov chains on a denumerable state space with risk sensitive discounted and ergodic cost criteria. For the discounted cost criterion we first show that the corresponding system of…

Optimization and Control · Mathematics 2016-03-09 Mrinal K. Ghosh , K. Suresh Kumar , Chandan Pal

This paper is devoted to studying constrained continuous-time Markov decision processes (MDPs) in the class of randomized policies depending on state histories. The transition rates may be unbounded, the reward and costs are admitted to be…

Probability · Mathematics 2012-01-04 Xianping Guo , Xinyuan Song

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 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 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 study infinite horizon discounted-cost and ergodic-cost risk-sensitive zero-sum stochastic games for controlled continuous time Markov chains on a countable state space. For the discounted-cost game we prove the existence of value and…

Optimization and Control · Mathematics 2016-03-09 Mrinal K. Ghosh , K. Suresh Kumar , Chandan Pal

We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the…

Computer Science and Game Theory · Computer Science 2014-10-02 Krishnendu Chatterjee , Rasmus Ibsen-Jensen

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 consider zero-sum stochastic games for continuous time Markov decision processes with risk-sensitive average cost criterion. Here the transition and cost rates may be unbounded. We prove the existence of the value of the game and a…

Optimization and Control · Mathematics 2021-09-21 Mrinal K. Ghosh , Subrata Golui , Chandan Pal , Somnath Pradhan

In this paper, we investigate a partially observable zero sum games where the state process is a discrete time Markov chain. We consider a general utility function in the optimization criterion. We show the existence of value for both…

Optimization and Control · Mathematics 2022-11-16 Arnab Bhabak , Subhamay saha

The paper is concerned with a zero-sum continuous-time stochastic differential game with a dynamics controlled by a Markov process and a terminal payoff. The value function of the original game is estimated using the value function of a…

Optimization and Control · Mathematics 2016-02-16 Yurii Averboukh

We study two-player zero-sum concurrent stochastic games with finite state and action space played for an infinite number of steps. In every step, the two players simultaneously and independently choose an action. Given the current state…

Computer Science and Game Theory · Computer Science 2024-10-10 Ali Asadi , Krishnendu Chatterjee , Raimundo Saona , Jakub Svoboda

We study a stochastic game framework with dynamic set of players, for modeling and analyzing their computational investment strategies in distributed computing. Players obtain a certain reward for solving the problem or for providing their…

Computer Science and Game Theory · Computer Science 2019-11-19 Swapnil Dhamal , Walid Ben-Ameur , Tijani Chahed , Eitan Altman , Albert Sunny , Sudheer Poojary