Linear Programming and Zero-Sum Two-Person Undiscounted Semi-Markov Games
DOI10.1142/S0217595915500438zbMath1335.90005OpenAlexW1910823034MaRDI QIDQ2788523
Publication date: 19 February 2016
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595915500438
semi-Markov gameslimiting average payoffsLP algorithmsone player control semi-Markov gamestraveling inspection problems
Linear programming (90C05) 2-person games (91A05) Transportation, logistics and supply chain management (90B06) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (5)
Cites Work
- Unnamed Item
- On discounted AR-AT semi-Markov games and its complementarity formulations
- Semi-Markov strategies in stochastic games
- An orderfield property for stochastic games when one player controls transition probabilities
- Linear programming and undiscounted stochastic games in which one player controls transitions
- PIVOTING ALGORITHMS FOR SOME CLASSES OF STOCHASTIC GAMES: A SURVEY
- Player aggregation in the traveling inspector model
- Linear Programming and Markov Decision Chains
- Algorithms for stochastic games ? A survey
- Zero-Sum Average Semi-Markov Games: Fixed-Point Solutions of the Shapley Equation
- Ordered Field Property for Semi-Markov Games when One Player Controls Transition Probabilities and Transition Times
- ORDERED FIELD PROPERTY IN A SUBCLASS OF FINITE SER-SIT SEMI-MARKOV GAMES
- A Note on Memoryless Rules for Controlling Sequential Control Processes
- On Average Reward Semi-Markov Decision Processes with a General Multichain Structure
- Stochastic games
This page was built for publication: Linear Programming and Zero-Sum Two-Person Undiscounted Semi-Markov Games