English
Related papers

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

200 papers

We show that an N-person non-cooperative semi-Markov game under limiting ratio average pay-off has a pure semi-stationary Nash equilibrium. In an earlier paper, the zero-sum two person case has been dealt with. The proof follows by reducing…

Computer Science and Game Theory · Computer Science 2024-02-27 K. G. Bakshi , S. Sinha

This work considers two-player zero-sum semi-Markov games with incomplete information on one side and perfect observation. At the beginning, the system selects a game type according to a given probability distribution and informs to Player…

Optimization and Control · Mathematics 2021-07-16 Fang Chen , Xianping Guo , Zhong-Wei Liao

This paper investigates the two-person zero-sum stochastic games for piece-wise deterministic Markov decision processes with risk-sensitive finite-horizon cost criterion on a general state space. Here, the transition and cost/reward rates…

Optimization and Control · Mathematics 2024-05-15 Subrata Golui

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

In this article we consider zero and non-zero sum risk-sensitive average criterion games for semi-Markov processes with a finite state space. For the zero-sum case, under suitable assumptions we show that the game has a value. We also…

Optimization and Control · Mathematics 2021-06-10 Arnab Bhabak , Subhamay Saha

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

We consider a nonzero-sum Markov game on an abstract measurable state space with compact metric action spaces. The goal of each player is to maximize his respective discounted payoff function under the condition that some constraints on a…

Optimization and Control · Mathematics 2021-09-28 François Dufour , Tomás Prieto-Rumeau

In this paper we consider two-person zero-sum risk-sensitive stochastic dynamic games with Borel state and action spaces and bounded reward. The term risk-sensitive refers to the fact that instead of the usual risk neutral optimization…

Optimization and Control · Mathematics 2021-07-21 Nicole Bäuerle , Ulrich Rieder

A basic question for zero-sum repeated games consists in determining whether the mean payoff per time unit is independent of the initial state. In the special case of "zero-player" games, i.e., of Markov chains equipped with additive…

Optimization and Control · Mathematics 2015-10-20 Marianne Akian , Stéphane Gaubert , Antoine Hochart

This paper considers a two-person zero-sum continuous-time Markov pure jump game in Borel state and action spaces over a fixed finite horizon. The main assumption on the model is the existence of a drift function, which bounds the reward…

Optimization and Control · Mathematics 2017-03-31 Xin Guo , Yi Zhang

We consider a zero-sum stochastic game for continuous-time Markov chain with countable state space and unbounded transition and pay-off rates. The additional feature of the game is that the controllers together with taking actions are also…

Optimization and Control · Mathematics 2020-09-01 Chandan Pal , Subhamay Saha

We study a finite-horizon two-person zero-sum risk-sensitive stochastic game for continuous-time Markov chains and Borel state and action spaces, in which payoff rates, transition rates and terminal reward functions are allowed to be…

Optimization and Control · Mathematics 2021-03-09 Junyu Zhang , Xianping Guo , Li Xia

This paper investigates value function approximation in the context of zero-sum Markov games, which can be viewed as a generalization of the Markov decision process (MDP) framework to the two-agent case. We generalize error bounds from MDPs…

Artificial Intelligence · Computer Science 2013-01-07 Michail Lagoudakis , Ron Parr

We study zero-sum stochastic games for controlled discrete time Markov chains with risk-sensitive average cost criterion with countable state space and Borel action spaces. The payoff function is nonnegative and possibly unbounded. Under a…

Optimization and Control · Mathematics 2022-01-12 Mrinal K. Ghosh , Subrata Golui , Chandan Pal , Somnath Pradhan

Stochastic games are an important class of problems that generalize Markov decision processes to game theoretic scenarios. We consider finite state two-player zero-sum stochastic games over an infinite time horizon with discounted rewards.…

Optimization and Control · Mathematics 2008-06-17 Parikshit Shah , Pablo A. Parrilo

We study a new class of Markov games, \emph(multi-player) zero-sum Markov Games} with \emph{Networked separable interactions} (zero-sum NMGs), to model the local interaction structure in non-cooperative multi-agent sequential…

Computer Science and Game Theory · Computer Science 2025-07-15 Chanwoo Park , Kaiqing Zhang , Asuman Ozdaglar

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

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 study a two-player discounted zero-sum stochastic game model for dynamic operational planning in military campaigns. At each stage, the players manage multiple commanders who order military actions on objectives that have an open line of…

Computer Science and Game Theory · Computer Science 2024-03-04 Joseph E. McCarthy , Mathieu Dahan , Chelsea C. White

In this paper, we consider discrete-time dynamic games of the mean-field type with a finite number $N$ of agents subject to an infinite-horizon discounted-cost optimality criterion. The state space of each agent is a locally compact Polish…

Systems and Control · Computer Science 2017-01-17 Naci Saldi , Tamer Başar , Maxim Raginsky
‹ Prev 1 2 3 10 Next ›