A note on two-person zero-sum communicating stochastic games
From MaRDI portal
Publication:2466590
DOI10.1016/j.orl.2005.07.008zbMath1133.91315OpenAlexW2084311211MaRDI QIDQ2466590
Zeynep Müge Avṣar, Melike Baykal-Gürsoy
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.07.008
2-person games (91A05) Stochastic games, stochastic differential games (91A15) Signaling and communication in game theory (91A28)
Related Items
Interval programming models for matrix games with interval payoffs ⋮ Matrix games with interval-valued 2-tuple linguistic information ⋮ Infrastructure security games ⋮ Methodology for Interval-Valued Matrix Games with 2-Tuple Fuzzy Linguistic Information ⋮ A fast approach to compute fuzzy values of matrix games with payoffs of triangular fuzzy numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Successive approximations for average reward Markov games
- Nonlinear programming and stationary equilibria in stochastic games
- A decomposition approach for undiscounted two-person zero-sum stochastic games
- Continuity of the value of competitive Markov decision processes
- Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach
- Successive Approximation Methods in Undiscounted Stochastic Games
- Variability Sensitive Markov Decision Processes
- On N-person stochastic games by denumerable state space
- Optimal decision procedures for finite Markov chains. Part III: General convex systems
- Perturbed Markov chains
- Singularly Perturbed Discrete-Time Markov Chains
- Markov Decision Processes with Sample Path Constraints: The Communicating Case
- On Nonterminating Stochastic Games
- The Big Match