We consider a sequence of discounted cost, constrained Markov control processes (CCPs) with countable state space, metric action set and possibly unbounded cost functions. We give conditions under which the sequence of optimal values of the CCPs converges to the optimal value of a limiting CCP,...

In this paper, we consider constrained noncooperative N-person stochastic games with discounted cost criteria. The state space is assumed to be countable and the action sets are compact metric spaces. We present three main results. The first concerns the sensitivity or approximation of...

We consider a sequence of discounted cost, constrained Markov control processes (CCPs) with countable state space, metric action set and possibly unbounded cost functions. We give conditions under which the sequence of optimal values of the CCPs converges to the optimal value of a limiting CCP,...

In this paper, we consider constrained noncooperative N-person stochastic games with discounted cost criteria. The state space is assumed to be countable and the action sets are compact metric spaces. We present three main results. The first concerns the sensitivity or approximation of...

We consider a sequence of discounted cost, constrained Markov control processes (CCPs) with countable state space, metric action set and possibly unbounded cost functions. We give conditions under which the sequence of optimal values of the CCPs converges to the optimal value of a limiting CCP,...

This paper concerns the general capacity (GC) problem on metric spaces. Conditions are given under which the strong duality condition holds, that is, GC and its dual GC<Superscript>*</Superscript> are both solvable and their optimal values coincide. Copyright Springer-Verlag Berlin Heidelberg 2001

This paper deals with continuous-time zero-sum two-person Markov games with denumerable state space, general (Borel) action spaces and possibly unbounded transition and reward/cost rates. We analyze the bias optimality and the weakly overtaking optimality criteria. An example shows that, in...

This paper deals with discrete-time Markov control processes in Borel spaces, with unbounded rewards. The criterion to be optimized is a long-run sample-path (or pathwise) average reward subject to constraints on a long-run pathwise average cost. To study this pathwise problem, we give...