Zero-sum Markov games and worst-case optimal control of queueing systems
type: Item
instance of: scholarly article
title: Zero-sum Markov games and worst-case optimal control of queueing systems
zbMATH Open document ID: 0859.90141
DOI: 10.1007/BF01149169
author: Eitan Altman
author: Arie Hordijk
published in: Queueing Systems
publication date: 1996-11-25T00:00:00Z
Mathematics Subject Classification ID: 91A15
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 933168
zbMATH Keywords: discounted and expected average cost
zbMATH Keywords: value iteration
zbMATH Keywords: zero-sum stochastic games
zbMATH Keywords: worst-case criterion
zbMATH Keywords: survey
zbMATH Keywords: stochastic games in queues
zbMATH Keywords: discounted Markov games
MaRDI profile type: Publication
cites work: Flow control using the theory of zero sum Markov games
cites work: Q4309855
cites work: Non zero-sum stochastic games in admission, service and routing control in queueing systems
cites work: Contraction Conditions for Average and α-Discount Optimality in Countable State Markov Games with Unbounded Rewards
cites work: Stochastic scheduling games with Markov decision arrival processes
cites work: Denumerable state stochastic games with limiting average payoff
cites work: Recent results on conditions for the existence of average optimal stationary policies
cites work: Average, Sensitive and Blackwell Optimal Policies in Denumerable Markov Decision Chains with Unbounded Rewards
cites work: On the Relation Between Recurrence and Ergodicity Properties in Denumerable Markov Decision Chains
cites work: Q3245641
cites work: Stable priority purchasing in queues
cites work: Optimal control of two interacting service stations
cites work: Equilibrium strategies and the value of information in a two line queueing system with threshold jockeying
cites work: Stable strategies for processor sharing systems
cites work: Sensitive Optimality Criteria in Countable State Dynamic Programming
cites work: On the convergence of moments in stationary Markov chains
cites work: On the Assignment of Customers to Parallel Queues
cites work: On the optimality of LEPT and μc rules for parallel processors and dependent arrival processes
cites work: On ergodicity and recurrence properties of a Markov chain by an application to an open jackson network
cites work: Q4858587
cites work: On the existence of equilibria in noncooperative optimal flow control
cites work: Applying a New Device in the Optimization of Exponential Queuing Systems
cites work: Q5186490
cites work: Optimal service control against worst case admission policies: A multichained stochastic game
cites work: Algorithms for stochastic games ? A survey
cites work: Q3976310
cites work: Nonzero-sum stochastic games with unbounded costs: Discounted and average cost cases
cites work: Optimal control of admission to a quenching system
cites work: Q4714399
cites work: Optimal control of service rates in networks of queues
cites work: Q4166658
description: scientific article; zbMATH DE number 933168