Denumerable state semi-markov decision processes with unbounded costs, average cost criterion : (preprint)

[1]  H. M. Taylor.  Markovian sequential replacement processes , 1965 .

[2]  C. Derman,et al.  A Note on Memoryless Rules for Controlling Sequential Control Processes , 1966 .

[3]  C. Derman.  DENUMERABLE STATE MARKOVIAN DECISION PROCESSES: AVERAGE COST CRITERION. , 1966 .

[4]  S. Ross,et al.  An Example in Denumerable Decision Processes , 1968 .

[5]  J. Bather.  Optimal decision procedures for finite Markov chains. Part III: General convex systems , 1973 .

[6]  J. Bather.  Optimal decision procedures for finite Markov chains. Part II: Communicating systems , 1973, Advances in Applied Probability.

[7]  J. Bather.  Optimal decision procedures for finite markov chains. Part I: Examples , 1973, Advances in Applied Probability.

[8]  Arie Hordijk,et al.  Dynamic programming and Markov potential theory , 1974 .

[9]  S. Lippman.  On Dynamic Programming with Unbounded Rewards , 1975 .

[10]  D. Robinson.  Markov decision chains with unbounded costs and applications to the control of queues , 1976, Advances in Applied Probability.

[11]  A. Hordijk.  Regenerative Markov decision models , 1976 .

[12]  Jacob Wijngaard,et al.  Stationary Markovian Decision Problems and Perturbation Theory of Quasi-Compact Linear Operators , 1977, Math. Oper. Res..

[13]  Awi Federgruen,et al.  RECURRENCE CONDITIONS IN DENUMERABLE STATE MARKOV DECISION PROCESSES , 1977 .

[14]  van der J Jan Wal,et al.  Successive approximations for convergent dynamic programming , 1977 .

[15]  A. Federgruen,et al.  A note on simultaneous recurrence conditions on a set of denumerable stochastic matrices : (preprint) , 1978 .

[16]  A. Federgruen,et al.  The optimality equation in average cost denumerable state semi-Markov decision problems, recurrency conditions and algorithms , 1978 .